Hybrid interactive theorem proving using Nuprl and HOL
From MaRDI portal
Recommendations
Cites work
- A proof of strong normalization for \(F_ 2\), \(F_ \omega\), and beyond
- Cache coherency in SCI: Specification and a sketch of correctness
- Edinburgh LCF. A mechanized logic of computation
- scientific article; zbMATH DE number 193479 (Why is no real title available?)
- scientific article; zbMATH DE number 1113859 (Why is no real title available?)
- scientific article; zbMATH DE number 234014 (Why is no real title available?)
- Isabelle. A generic theorem prover
Cited in
(6)- A synthesis of the procedural and declarative styles of interactive theorem proving
- scientific article; zbMATH DE number 3986665 (Why is no real title available?)
- scientific article; zbMATH DE number 1113859 (Why is no real title available?)
- scientific article; zbMATH DE number 1863394 (Why is no real title available?)
- Importing mathematics from HOL into Nuprl
- Innovations in computational type theory using Nuprl
This page was built for publication: Hybrid interactive theorem proving using Nuprl and HOL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5234717)