HOL - A Machine Oriented Formulation of Higher Order Logic (2001)

Cached

Download Links

by Mike Gordon
Citations:63 - 1 self

Documents Related by Co-Citation

854 A formulation of the simple theory of types – Alonzo Church - 1940
533 A Computational Logic – R BOYER, J MOORE - 1979
532 PVS: A Prototype Verification System – S. Owre, J. M. Rushby, N. Shankar - 1992
374 Uniform proofs as a foundation for logic programming – Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov - 1991
291 A logic programming language with lambda-abstraction, function variables, and simple unification – Dale Miller - 1990
169 A unification algorithm for typed -calculus – G Huet - 1975
422 The Foundation of a Generic Theorem Prover – Lawrence C. Paulson - 1989
199 hol: A proof generating system for higher-order logic – M J C Gordon
20 Encoding Dependent Types in an Intuitionistic Logic – Amy Felty - 1991
696 A Framework for Defining Logics – Robert Harper , Furio Honsell, Gordon Plotkin - 1993
175 Logic Programming in the LF Logical Framework – Frank Pfenning - 1991
56 Constable et al. Implementing Mathematics with the Nuprl Proof Development System – L Robert - 1986
72 Constructions: A Higher Order Proof System for Mechanizing Mathematics – T Coquand, G P Huet - 1985
302 Higher-order abstract syntax – F Pfenning, C Elliott - 1988
132 Edinburgh LCF: A Mechanised Logic of Computation. LNCS 78 – M J C Gordon, R Milner, C P Wadsworth - 1979
4 Models and logic of MOS circuits’, in: Logic of Programming and Calculi of Discrete Design: International Summer School Directed by – G Winskel - 1987
23 Specification and verification using higher-order logic: A case study – F K Hanna, N Daeche - 1986
56 A proof of correctness of the VIPER microprocessor: the first levels – A Cohn - 1987
939 A theory of type polymorphism in programming – Robin Milner - 1978