Proofs, Programs and Executable Specifications in Higher Order Logic (2003)

by Stefan Berghofer
Venue:PHD THESIS, INSTITUT FÜR INFORMATIK
Citations:9 - 2 self

Active Bibliography

9 Program Extraction in simply-typed Higher Order Logic – Stefan Berghofer - 2002
2 More On Implicit Syntax – Marko Luther, Universität Ulm
5 Verifying Uniqueness in a Logical Framework – Penny Anderson, Frank Pfenning - 2004
39 A Coverage Checking Algorithm for LF – Carsten Schürmann, Frank Pfenning - 2003
20 Hybridizing a logical framework – Jason Reed, Karl Crary, Robert Harper - 2006
2 Extracting a normalization algorithm in Isabelle/HOL – Stefan Berghofer - 2004
2 An interpretation of isabelle/hol in hol light – Sean Mclaughlin
Sequent Style Proof Terms for HOL – Tom Ridge
Representation and Validation of Mechanically Generated Proofs Final Report – Michael J. C. Gordon
7 Verification of the MDG Components Library in HOL – Paul Curzon, Sofiène Tahar, Otmane Aït Mohamed, Otmane Ait Mohamed - 1998
1 A constructive proof of Higman’s lemma – Stefan Berghofer, Technische Universität München - 1984
1 Internal Program Extraction in the Calculus of Inductive Constructions – Paula Severi, Nora Szasz - 2002
16 Towards Self-verification of HOL Light – John Harrison - 2006
13 The Implicit Calculus of Constructions - Extending Pure Type Systems with an Intersection Type Binder and Subtyping – Alexandre Miquel - 2001
24 Closure Under Alpha-Conversion – Randy Pollack - 1993
5 The Open Calculus of Constructions: An Equational Type Theory with Dependent Types for Programming, Specification, and Interactive Theorem Proving – Mark-Oliver Stehr
25 Coercive Subtyping in Type Theory – Zhaohui Luo - 1996
7 Turning inductive into equational specifications – Stefan Berghofer, Lukas Bulwahn, Florian Haftmann, Technische Universität München
2 Gdansk Development Method - A Short Overview – Stefan Sokolowski - 1990