Inductive datatypes in HOL - lessons learned in Formal-Logic Engineering (1999)

by Stefan Berghofer , Markus Wenzel
Venue:Theorem Proving in Higher Order Logics: TPHOLs ’99, LNCS 1690
Citations:42 - 6 self

Documents Related by Co-Citation

724 M.: Isabelle/HOL - A Proof Assistant for HigherOrder Logic – T Nipkow, L C Paulson, Wenzel - 2002
51 Winskel is (almost) Right - Towards a Mechanized Semantics Textbook – Tobias Nipkow - 1998
854 A formulation of the simple theory of types – Alonzo Church - 1940
311 An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof (2nd Ed – Peter B Andrews - 2002
44 A fixedpoint approach to implementing (co)inductive definitions – L C Paulson - 1994
199 Melham, editors. Introduction to HOL: A theorem proving environment for higher order logic – M J C Gordon, T F - 1993
41 Mechanizing Coinduction and Corecursion in Higher-order Logic – Lawrence C. Paulson - 1997
80 Nominal techniques in Isabelle/HOL – Christian Urban - 2005
33 B.: The HOL-OCL Book – A D Brucker, Wolff - 2006
38 Object-Oriented Verification based on Record Subtyping in Higher-Order Logic – Wolfgang Naraschewski, Markus Wenzel - 1998
20 A Fixedpoint Approach to (Co)Inductive and (Co)Datatype Definitions – Lawrence C. Paulson - 1997
239 Formal Semantics of Programming Languages – Glynn Winskel
12 A sequent-style model elimination strategy and a positive refinement – David A Plaisted - 1990
5 A Case Study of Co-induction in Isabelle HOL – Jacob Frost - 1993
3 9] Robin Milner and Mads Tofte. Co-induction in relational semantics – Sys Sci - 1978
34 Deductive Synthesis of the Unification Algorithm – Z Manna, R Waldinger - 1981
22 Function definition in higher order logic – Konrad Slind - 1996
10 A Formulation of the Simple Theory of Types (for Isabelle) – Lawrence C. Paulson - 1989
43 Set Theory for Verification: II - Induction and Recursion – Lawrence C. Paulson - 2000