 | 2009 |
|---|
| 20 |       | Stefan Berghofer,
Tobias Nipkow,
Christian Urban,
Makarius Wenzel:
Theorem Proving in Higher Order Logics, 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedings
Springer 2009 |
| 19 | | Stefan Berghofer,
Lukas Bulwahn,
Florian Haftmann:
Turning Inductive into Equational Specifications.
TPHOLs 2009: 131-146 |
| 18 | | Stefan Berghofer,
Markus Reiter:
Formalizing the Logic-Automaton Connection.
TPHOLs 2009: 147-163 |
| 2008 |
|---|
| 17 | | Stefan Berghofer,
Makarius Wenzel:
Logic-Free Reasoning in Isabelle/Isar.
AISC/MKM/Calculemus 2008: 355-369 |
| 16 | | Christian Urban,
James Cheney,
Stefan Berghofer:
Mechanizing the Metatheory of LF.
LICS 2008: 45-56 |
| 15 | | Stefan Berghofer,
Christian Urban:
Nominal Inversion Principles.
TPHOLs 2008: 71-85 |
| 14 | | Christian Urban,
James Cheney,
Stefan Berghofer:
Mechanizing the Metatheory of LF
CoRR abs/0804.1667: (2008) |
| 2007 |
|---|
| 13 | | Christian Urban,
Stefan Berghofer,
Michael Norrish:
Barendregt's Variable Convention in Rule Inductions.
CADE 2007: 35-50 |
| 12 | | Stefan Berghofer,
Christian Urban:
A Head-to-Head Comparison of de Bruijn Indices and Names.
Electr. Notes Theor. Comput. Sci. 174(5): 53-67 (2007) |
| 2006 |
|---|
| 11 | | Christian Urban,
Stefan Berghofer:
A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL.
IJCAR 2006: 498-512 |
| 10 | | Ulrich Berger,
Stefan Berghofer,
Pierre Letouzey,
Helmut Schwichtenberg:
Program Extraction from Normalization Proofs.
Studia Logica 82(1): 25-49 (2006) |
| 2004 |
|---|
| 9 | | Stefan Berghofer,
Tobias Nipkow:
Random Testing in Isabelle/HOL.
SEFM 2004: 230-239 |
| 8 | | Stefan Berghofer:
Extracting a Normalization Algorithm in Isabelle/HOL.
TYPES 2004: 50-65 |
| 2003 |
|---|
| 7 | | Stefan Berghofer:
A Constructive Proof of Higman's Lemma in Isabelle.
TYPES 2003: 66-82 |
| 6 | | Stefan Berghofer,
Martin Strecker:
Extracting a formally verified, fully executable compiler from a proof assistant.
Electr. Notes Theor. Comput. Sci. 82(2): (2003) |
| 2002 |
|---|
| 5 | | Stefan Berghofer:
Program Extraction in Simply-Typed Higher Order Logic.
TYPES 2002: 21-38 |
| 2001 |
|---|
| 4 | | Christine Röckl,
Daniel Hirschkoff,
Stefan Berghofer:
Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the pi-Calculus and Mechanizing the Theory of Contexts.
FoSSaCS 2001: 364-378 |
| 2000 |
|---|
| 3 | | Stefan Berghofer,
Tobias Nipkow:
Proof Terms for Simply Typed Higher Order Logic.
TPHOLs 2000: 38-52 |
| 2 | | Stefan Berghofer,
Tobias Nipkow:
Executing Higher Order Logic.
TYPES 2000: 24-40 |
| 1999 |
|---|
| 1 | | Stefan Berghofer,
Markus Wenzel:
Inductive Datatypes in HOL - Lessons Learned in Formal-Logic Engineering.
TPHOLs 1999: 19-36 |
