default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCoRR, January 1993
- Lawrence C. Paulson:
Verifying the Unification Algorithm in LCF. - Lawrence C. Paulson:
Constructing Recursion Operators in Intuitionistic Type Theory. - Lawrence C. Paulson:
Proving Termination of Normalization Functions for Conditional Expressions. - Lawrence C. Paulson:
Natural Deduction as Higher-Order Resolution. - Lawrence C. Paulson:
The Foundation of a Generic Theorem Prover. - Lawrence C. Paulson:
Isabelle: The Next 700 Theorem Provers. - Lawrence C. Paulson:
A Formulation of the Simple Theory of Types (for Isabelle). - Lawrence C. Paulson:
A Higher-Order Implementation of Rewriting. - Lawrence C. Paulson, Andrew W. Smith:
Logic Programming, Functional Programming, and Inductive Definitions. - Lawrence C. Paulson:
Designing a Theorem Prover.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-05 22:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
