The Foundation of a Generic Theorem Prover (1989)

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

Active Bibliography

19 Higher Order Logic – Daniel Leivant - 1994
Contents – The Phragmén-lindelöf Theorem - 2006
2 Proof-search in type-theoretic languages: an introduction – Didier Galmiche, David J. Pym - 2000
7 Designing a Theorem Prover – Lawrence C Paulson - 1990
217 A Linear Logical Framework – Iliano Cervesato, Frank Pfenning - 1996
25 Extensions and Applications of Higher-order Unification – Conal M. Elliott - 1990
54 Natural Deduction as Higher-Order Resolution – Lawrence C Paulson - 1986
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
124 Unification under a mixed prefix – Dale Miller - 1992
36 An Extension to ML to Handle Bound Variables in Data Structures – Dale Miller - 1990
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
9 Program Development Schemata as Derived Rules – Penny Anderson, David Basin - 2000
5 Equivalences between Logics and their Representing Type Theories – Philippa Gardner - 1992
71 tps: A theorem proving system for classical type theory – Peter B. Andrews, Matthew Bishop, Sunil Issar, Dan Nesmith, Frank Pfenning, Hongwei Xi - 1996
102 The Proof-Theory and Semantics of Intuitionistic Modal Logic – Alex K. Simpson - 1994
7 Partial computations in constructive type theory – Scott F. Smith - 1991
62 Higher-Order Horn Clauses – Gopalan Nadathur, Dale Miller - 1990
1 A Preliminary User's Manual for Isabelle – Lawrence C Paulson