Information and Computation - Semantics of Data Types
The foundation of a generic theorem prover
Journal of Automated Reasoning
Computational aspects of an order-sorted logic with term declarations
Computational aspects of an order-sorted logic with term declarations
Notes on set theory
Set theory for verification. I: from foundations to functions
Journal of Automated Reasoning
Should your specification language be typed
ACM Transactions on Programming Languages and Systems (TOPLAS)
Set Theory, Higher Order Logic or Both?
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Type Classes and Overloading in Higher-Order Logic
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Journal of Functional Programming
Structured formal development in Isabelle
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Twenty Years of Theorem Proving for HOLs Past, Present and Future
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Constructive type classes in Isabelle
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Importing HOL into Isabelle/HOL
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Checking conservativity of overloaded definitions in higher-order logic
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
A foundational view on integration problems
MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
Scalable LCF-Style proof translation
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
| Hi-index | 0.00 |
In order to make existing formalizations available for set-theoretic developments, we present an automated translation of theories from Isabelle/HOL to Isabelle/ZF. This covers all fundamental primitives, particularly type classes. The translation produces LCF-style theorems that are checked by Isabelle's inference kernel. Type checking is replaced by explicit reasoning about set membership.