Theorem proving in higher order logics. 21st international conference, TPHOLs 2008, Montreal, Canada, August 18--21, 2008. Proceedings

DOI10.1007/978-3-540-71067-7zbMath1149.68013OpenAlexW3168162705MaRDI QIDQ955386

No author found.

Publication date: 20 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71067-7

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Related Items (6)

Self-formalisation of higher-order logic. Semantics, soundness, and a verified implementation ⋮ The role of entropy in guiding a connection prover ⋮ Proof-Producing Reflection for HOL ⋮ TacticToe: learning to prove with tactics ⋮ Validating QBF Validity in HOL4 ⋮ Matching Concepts across HOL Libraries

Uses Software

• Unnamed Item
• Unnamed Item
• Unnamed Item
• PVS
• Boogie

This page was built for publication: Theorem proving in higher order logics. 21st international conference, TPHOLs 2008, Montreal, Canada, August 18--21, 2008. Proceedings