Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Stefan Berghofer
2010 – today
- 2012
[j8]Stefan Berghofer: A Solution to the PoplMark Challenge Using de Bruijn Indices in Isabelle/HOL. J. Autom. Reasoning 49(3): 303-326 (2012)- 2011
[j7]Christian Urban, James Cheney, Stefan Berghofer: Mechanizing the metatheory of LF. ACM Trans. Comput. Log. 12(2): 15 (2011)
[c17]Dmitriy Traytel, Stefan Berghofer, Tobias Nipkow: Extending Hindley-Milner Type Inference with Coercive Structural Subtyping. APLAS 2011: 89-104
[c16]
2000 – 2009
- 2009
[j6]Stefan Berghofer, Markus Reiter: Formalizing the Logic-Automaton Connection. Archive of Formal Proofs 2009 (2009)
[c15]Stefan Berghofer, Lukas Bulwahn, Florian Haftmann: Turning Inductive into Equational Specifications. TPHOLs 2009: 131-146
[c14]
[e1]Stefan Berghofer, Tobias Nipkow, Christian Urban, Makarius Wenzel (Eds.): Theorem Proving in Higher Order Logics, 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedings. Lecture Notes in Computer Science 5674, Springer 2009, ISBN 978-3-642-03358-2- 2008
[c13]Stefan Berghofer, Makarius Wenzel: Logic-Free Reasoning in Isabelle/Isar. AISC/MKM/Calculemus 2008: 355-369
[c12]
[c11]
[i1]Christian Urban, James Cheney, Stefan Berghofer: Mechanizing the Metatheory of LF. CoRR abs/0804.1667 (2008)- 2007
[j5]
[j4]
[j3]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)
[c10]Christian Urban, Stefan Berghofer, Michael Norrish: Barendregt's Variable Convention in Rule Inductions. CADE 2007: 35-50- 2006
[j2]Ulrich Berger, Stefan Berghofer, Pierre Letouzey, Helmut Schwichtenberg: Program Extraction from Normalization Proofs. Studia Logica 82(1): 25-49 (2006)
[c9]Christian Urban, Stefan Berghofer: A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL. IJCAR 2006: 498-512- 2004
[c8]
[c7]- 2003
[b1]Stefan Berghofer: Proofs, programs and executable specifications in higher order logic. Technical University Munich 2003, pp. 1-161
[j1]Stefan Berghofer, Martin Strecker: Extracting a formally verified, fully executable compiler from a proof assistant. Electr. Notes Theor. Comput. Sci. 82(2): 377-394 (2003)
[c6]- 2002
[c5]- 2001
[c4]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
[c3]Stefan Berghofer, Tobias Nipkow: Proof Terms for Simply Typed Higher Order Logic. TPHOLs 2000: 38-52
[c2]
1990 – 1999
- 1999
[c1]Stefan Berghofer, Markus Wenzel: Inductive Datatypes in HOL - Lessons Learned in Formal-Logic Engineering. TPHOLs 1999: 19-36
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:59 CET by the dblp team



