An introduction to mathematical logic and type theory: to truth through proof
An introduction to mathematical logic and type theory: to truth through proof
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
The Z notation: a reference manual
The Z notation: a reference manual
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
Handbook of logic in computer science (vol. 2)
Order-sorted polymorphism in Isabelle
Papers presented at the second annual Workshop on Logical environments
The object constraint language: precise modeling with UML
The object constraint language: precise modeling with UML
Experience with Embedding Hardware Description Languages in HOL
Proceedings of the IFIP TC10/WG 10.2 International Conference on Theorem Provers in Circuit Design: Theory, Practice and Experience
Proceedings of the 8th International Workshop on Higher Order Logic Theorem Proving and Its Applications
A Structure Preserving Encoding of Z in Isabelle/HOL
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
A Proposal for a Formal OCL Semantics in Isabelle/HOL
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
HOL-OCL: Experiences, Consequences and Design Choices
UML '02 Proceedings of the 5th International Conference on The Unified Modeling Language
Proceedings of the 1992 Glasgow Workshop on Functional Programming
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
| Hi-index | 0.00 |
Tools for a specification language can be implemented directly (by building a special purpose theorem prover) or by a conservative embedding into a typed meta-logic, which allows their safe and logically consistent implementation and the reuse of existing theorem prover engines. For being useful, the conservative extension approach must provide derivations for several thousand "folklore" theorems. In this paper, we present an approach for deriving the mass of these theorems mechanically from an existing library of the meta-logic. The approach presupposes a structured theory morphism mapping library datatypes and library functions to new functions of the specification language while uniformly modifying some semantic properties; for example, new functions may have a different treatment of undefinedness compared to old ones.