LCF Examples in HOL (1994)

Cached

Download Links

by Sten Agerholm , Sten Agerholm
Venue:The Computer Journal
Citations:12 - 4 self

Active Bibliography

23 A HOL basis for reasoning about functional programs – Sten Agerholm - 1994
3 Formalising a Model of the lambda-calculus in HOL-ST – Sten Agerholm - 1994
24 HOLCF: Higher Order Logic of Computable Functions – Franz Regensburger - 1995
2 Non-primitive Recursive Function Definitions – Sten Agerholm, Sten Agerholm - 1995
41 Mechanizing Coinduction and Corecursion in Higher-order Logic – Lawrence C. Paulson - 1997
14 Proving Termination of Normalization Functions for Conditional Expressions – Lawrence C Paulson - 1986
9 Verifying the Unification Algorithm in LCF – Lawrence C. Paulson - 1985
3 HOLCF ’11: A Definitional Domain Theory for Verifying Functional Programs – Brian Charles Huffman, Mark Jones, Tim Sheard, Gerardo Lafferriere - 2012
3 Formalizing Fixed-Point Theory in PVS – F. Bartels, A. Dold, H. Pfeifer, F. W. Von Henke, H. Rueß - 1996
1 Mechanizing Domain Theory – F. Bartels, H. Pfeifer, F. von Henke, H. Rue - 1996
22 Isabelle's Object-Logics – Lawrence C. Paulson - 1997
20 A Fixedpoint Approach to (Co)Inductive and (Co)Datatype Definitions – Lawrence C. Paulson - 1997
53 Metatheory and Reflection in Theorem Proving: A Survey and Critique – John Harrison - 1995
Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Computer Assisted Reasoning – A Festschrift, Michael J. C. Gordon, Richard Boulton, Joe Hurd, Konrad Slind - 2009
5 Tool Support for Logics of Programs – Lawrence C. Paulson - 1996
12 Some domain theory and denotational semantics in Coq – Nick Benton, Andrew Kennedy, Carsten Varming - 2009
Design, Analysis and Reasoning about Tools: Abstracts from the Third Workshop – Flemming Nielson, (Ed.) - 1993
5 Induction Proofs with Partial Functions – Jürgen Giesl - 1998
21 Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm – Alessandro Armando, Alan Smaill, Ian Green - 1997