scientific article; zbMATH DE number 4053566
[For the entire collection see Zbl 0638.00038.] This paper describes an implementation within Nuprl of mechanisms that support the use of Nuprl's type theory as a language for constructing theorem-proving procedures. The main component of the implementation is a large library of definitions, theorems and proofs. This library may be regarded as the beginning of a book of formal mathematics; it contains the formal development and explanation of a useful subset of Nuprl's metatheory, and of a mechanism for translating results established about this embedded metatheory to the object level. Nuprl's rich type theory, besides permitting the internal development of this partial reflection mechanism, allows us to make abstractions that drastically reduce the burden of establishing the correctness of new theorem-proving procedures. Our library includes a formally verified term-rewriting system.
- Metacircularity in the polymorphic -calculus
- Program tactics and logic tactics
- Nuprl
- A metatheory of a mechanized object theory
- Metainferential reasoning on strong Kleene models
- Towards a formally verified proof assistant
- scientific article; zbMATH DE number 3986665 (Why is no real title available?)
- scientific article; zbMATH DE number 4101139 (Why is no real title available?)
- scientific article; zbMATH DE number 50754 (Why is no real title available?)
- A type annotation scheme for Nuprl
- Semantic foundations for embedding HOL in Nuprl
- Some normalization properties of Martin-Löf's type theory, and applications
- A verified theorem prover backend supported by a monotonic library
- Formal program optimization in Nuprl using computational equivalence and partial types
- Proof by computation in the Coq system
- Innovations in computational type theory using Nuprl
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789525)