Set theory for verification: I. From foundations to functions (1993)

by Lawrence C. Paulson
Venue:J. Auto. Reas
Citations:46 - 18 self

Active Bibliography

Set Theory as a Computational Logic: I. From Foundations to Functions – Lawrence C. Paulson - 1992
43 Introduction to Isabelle – Lawrence C. Paulson - 1998
6 Tool Support for Logics of Programs – Lawrence C. Paulson - 1996
16 Mechanizing set theory: Cardinal arithmetic and the axiom of choice – Lawrence C. Paulson, Krzysztof Grabczewski - 1996
19 Higher Order Logic – Daniel Leivant - 1994
7 Designing a Theorem Prover – Lawrence C Paulson - 1990
26 Isabelle Tutorial and User's Manual – Lawrence Paulson, Tobias Nipkow, Brian Monahan, Martin Coen, Annette Schumann - 1990
38 A generic tableau prover and its integration with Isabelle – Lawrence C. Paulson - 1999
26 Generic Automatic Proof Tools – Lawrence C. Paulson - 1997
Contents – The Phragmén-lindelöf Theorem - 2006
Old Introduction to Isabelle – Lawrence C. Paulson, Tobias Nipkow, Markus Wenzel
2 Proof-search in type-theoretic languages: an introduction – Didier Galmiche, David J. Pym - 2000
4 The reflection theorem: A study in meta-theoretic reasoning – Lawrence C. Paulson - 2002
68 The Theory of LEGO - A Proof Checker for the Extended Calculus of Constructions – Robert Pollack - 1994
43 Set Theory for Verification: II - Induction and Recursion – Lawrence C. Paulson - 2000
45 Should Your Specification Language Be Typed? – Leslie Lamport , Lawrence C. Paulson - 1999
175 Logic Programming in the LF Logical Framework – Frank Pfenning - 1991
422 The Foundation of a Generic Theorem Prover – Lawrence C. Paulson - 1989
155 Higher-order logic programming – Gopalan Nadathur, Dale Miller