Implementing theorem provers in a purely functional style

DOI10.1017/S095679689900338XMaRDI QIDQ4267721zbMATH OpenOpenAlexFDO

Authors Keith Hanna

Publication date 5 October 1999

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s095679689900338x

zbMATH Keywords

functional metalanguage

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 4049001
• A higher-order implementation of rewriting
• Functional design and implementation of graphical user interfaces for theorem provers
• An approach to the extension of a theorem prover by advanced structuring mechanisms.
• Lessons learned from LCF: A Survey of Natural Deduction Proofs

Cited in

(4)

• scientific article; zbMATH DE number 4049001 (Why is no real title available?)
• Functional design and implementation of graphical user interfaces for theorem provers
• The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving
• Beyond Notations: Hygienic Macro Expansion for Theorem Proving Languages

This page was built for publication: Implementing theorem provers in a purely functional style

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4267721)