The Foundation of a Generic Theorem Prover (1989)

by Lawrence C. Paulson
Venue:Journal of Automated Reasoning
Citations:419 - 47 self

Documents Related by Co-Citation

854 A formulation of the simple theory of types – Alonzo Church - 1940
696 A Framework for Defining Logics – Robert Harper , Furio Honsell, Gordon Plotkin - 1993
473 The Calculus of Constructions – T Coquand, G Huet - 1988
70 Specifying theorem provers in a higherorder logic programming language – Amy Felty, Dale Miller - 1988
77 Elf: A Language for Logic Definition and Verified Metaprogramming – Frank Pfenning - 1989
83 Using Typed Lambda Calculus to Implement Formal Systems on a Machine – Arnon Avron, Furio Honsell, Ian A. Mason, Robert Pollack - 1992
114 A unification algorithm for typed λ-calculus – G Huet - 1975
46 Specifying and Implementing Theorem Provers in a Higher-Order Logic Programming Language – Amy P. Felty, Dale Miller, Jean Gallier, Amy P. Felty, Supervisor Dale Miller - 1989
291 A logic programming language with lambda-abstraction, function variables, and simple unification – Dale Miller - 1990
354 Prudent Engineering Practice for Cryptographic Protocols – Martin Abadi, Roger Needhamt - 1994
150 Proving Properties of Security Protocols by Induction – Lawrence C. Paulson - 1997
6 On Two Formal Analyses of the Yahalom Protocol – L C Paulson - 1997
1132 A logic of authentication – Michael Burrows, Martín Abadi, Roger Needham - 1990
613 Breaking and Fixing the Needham-Schroeder Public-Key Protocol using FDR – Gavin Lowe - 1996
311 An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof (2nd Ed – Peter B Andrews - 2002
101 The π-calculus as a theory in linear logic: Preliminary results – Dale Miller - 1993
1000 Bigraphs and Mobile Processes – Ole Høgh Jensen, Robin Milner - 2003
262 Investigations into logical deduction – G Gentzen - 1969
64 Lexical scoping as universal quantification – Dale Miller - 1989