Parallel program design: a foundation
Parallel program design: a foundation
Larch: languages and tools for formal specification
Larch: languages and tools for formal specification
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
IMPS: an interactive mathematical proof system
Journal of Automated Reasoning
A Formal Proof of Sylow‘s Theorem
Journal of Automated Reasoning
HOL'92 Proceedings of the IFIP TC10/WG10.2 Workshop on Higher Order Logic Theorem Proving and its Applications
Object-Oriented Verification Based on Record Subtyping in Higher-Order Logic
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Modular Structures as Dependent Types in Isabelle
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
PVS: Combining Specification, Proof Checking, and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Context Aware Calculation and Deduction
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Parametric Linear Arithmetic over Ordered Fields in Isabelle/HOL
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Toward a Practical Module System for ACL2
PADL '09 Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages
Local Theory Specifications in Isabelle/Isar
Types for Proofs and Programs
An approach for machine-assisted verification of Timed CSP specifications
Innovations in Systems and Software Engineering
Verified efficient enumeration of plane graphs modulo isomorphism
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Developer-oriented correctness proofs a case study of Cheney's algorithm
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Interpretation of locales in isabelle: theories and proof contexts
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
Axiomatic constructor classes in Isabelle/HOLCF
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Mechanical Analysis of Finite Idempotent Relations
Fundamenta Informaticae
Information and Computation
Locales: A Module System for Mathematical Theories
Journal of Automated Reasoning
| Hi-index | 0.00 |
Locales are a means to define local scopes for the interactive proving process of the theorem prover Isabelle. They delimit a range in which fixed assumption are made, and theorems are proved that depend on these assumptions. A locale may also contain constants defined locally and associated with pretty printing syntax. Locales can be seen as a simple form of modules. They are similar to sections as in AUTOMATH or Coq. Locales are used to enhance abstract reasoning and similar applications of theorem provers. This paper motivates the concept of locales by examples from abstract algebraic reasoning. It also discusses some implementation issues.