Partial recursive functions in higher-order logic (2006)

by Alexander Krauss
Venue:Int. Joint Conference on Automated Reasoning (IJCAR 2006), LNCS
Citations:12 - 2 self

Documents Related by Co-Citation

731 Isabelle/HOL: a proof assistant for higher-order logic, volume 2283 – Tobias Nipkow, Lawrence C Paulson, Markus Wenzel - 2002
33 Order-sorted polymorphism in isabelle – Tobias Nipkow, Tu München - 1993
31 Type Checking Type Classes – Tobias Nipkow, Christian Prehofer - 1993
35 Locales: A sectioning concept for Isabelle – Florian Kammüller, Markus Wenzel, Lawrence C. Paulson - 1999
71 Type Classes and Overloading in Higher-Order Logic – Markus Wenzel, Technische Universität München - 1997
347 How to Make Ad-Hoc Polymorphism Less Ad Hoc – Philip Wadler, Stephen Blott - 1988
3 Code generation from Isabelle theories. http://isabelle.in.tum.de/doc/codegen.pdf – Florian Haftmann
8 ML modules and Haskell type classes: A constructive comparison – Stefan Wehr, Manuel M. T. Chakravarty
13 Constructive type classes in Isabelle – Florian Haftmann, Makarius Wenzel - 2007
15 Finding lexicographic orders for termination proofs in Isabelle/HOL – Lukas Bulwahn, Er Krauss, Tobias Nipkow - 2007
13 Verified Lexical Analysis – Tobias Nipkow - 1998
48 Executing higher order logic – Stefan Berghofer, Tobias Nipkow, Technische Universität München - 2002
26 Termination analysis with calling context graphs – Panagiotis Manolios, Daron Vroon - 2006
5 The hol light theorem prover. http://www.cl.cam.ac.uk/~jrh13/ hol-light – John Harrison
175 The Size-Change Principle for Program Termination – Chin Soon Lee, Neil D. Jones, Amir M. Ben-amram - 2001
198 Melham, editors. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic – M J C Gordon, T F - 1993
538 PVS: A Prototype Verification System – S. Owre, J. M. Rushby, N. Shankar - 1992
264 Computer-Aided Reasoning: An Approach – M Kaufmann, P Monolios, J S Moore - 2000
2352 Monotone Complexity – Michelangelo Grigni , Michael Sipser - 1990