Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Function Definition in Higher-Order Logic
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
Locales - A Sectioning Concept for Isabelle
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Proof-assistants using dependent type systems
Handbook of automated reasoning
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
Context Aware Calculation and Deduction
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Constructive type classes in Isabelle
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Building formal method tools in the Isabelle/Isar framework
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Interpretation of locales in isabelle: theories and proof contexts
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
Packaging Mathematical Structures
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Reasoning about memory layouts
Formal Methods in System Design
Automated engineering of relational and algebraic methods in isabelle/hol
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Three chapters of measure theory in Isabelle/HOL
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Automating algebraic methods in isabelle
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Developing the algebraic hierarchy with type classes in coq
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Automated reasoning in higher-order regular algebra
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
Type classes and filters for mathematical analysis in Isabelle/HOL
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Locales: A Module System for Mathematical Theories
Journal of Automated Reasoning
Hi-index | 0.00 |
The proof assistant Isabelle has recently acquired a "local theory" concept that integrates a variety of mechanisms for structured specifications into a common framework. We explicitly separate a local theory "target", i.e. a fixed axiomatic specification consisting of parameters and assumptions, from its "body" consisting of arbitrary definitional extensions. Body elements may be added incrementally, and admit local polymorphism according to Hindley-Milner. The foundations of our local theories rest firmly on existing Isabelle/Isar principles, without having to invent new logics or module calculi. Specific target contexts and body elements may be implemented within the generic infrastructure. This results in a large combinatorial space of specification idioms available to the user. Here we introduce targets for locales, type-classes, and class instantiations. The available selection of body elements covers primitive definitions and theorems, inductive predicates and sets, and recursive functions. Porting such existing definitional packages is reasonably simple, and allows to re-use sophisticated tools in a variety of target contexts. For example, a recursive function may be defined depending on locale parameters and assumptions, or an inductive predicate definition may provide the witness in a type-class instantiation.