On understanding types, data abstraction, and polymorphism
ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
The Z notation: a reference manual
The Z notation: a reference manual
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Reasonong about Classess in Object-Oriented Languages: Logical Models and Tools
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
A Structure Preserving Encoding of Z in Isabelle/HOL
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Set Theory, Higher Order Logic or Both?
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
A Theory of Structured Model-Based Specifications in Isabelle/HOL
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Object-Oriented Verification Based on Record Subtyping in Higher-Order Logic
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
I/O Automata and Beyond: Temporal Logic and Abstraction in Isabelle
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
On the Semantic Relation of Z and HOL
ZUM '98 Proceedings of the 11th International Conference of Z Users on The Z Formal Specification Notation
A Corrected Failure Divergence Model for CSP in Isabelle/HOL
FME '97 Proceedings of the 4th International Symposium of Formal Methods Europe on Industrial Applications and Strengthened Foundations of Formal Methods
More Church-Rosser Proofs (in Isabelle/HOL)
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Encoding Object-Z in Isabelle/HOL
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Mechanized Analysis of Behavioral Conformance in the Eiffel Base Libraries
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
| Hi-index | 0.00 |
We present a theory of isomorphisms between typed sets in Isabelle/ HOL. Those isomorphisms can serve to link a shallow embedding with a theory that defines certain concepts directly in HOL. Thus, it becomes possible to use the advantage of a shallow embedding that it allows for efficient proofs about concrete terms of the embedded formalism with the advantage of a deeper theory that establishes general abstract propositions about the key concepts of the embedded formalism as theorems in HOL.