Composable Packages for Higher Order Logic Theories

15 pages•Published: May 15, 2012

Abstract

Interactive theorem proving is tackling ever larger formalization and verification projects, and there is a critical need for theory engineering techniques to support these efforts. One such technique is effective package management, which has the potential to simplify the development of logical theories by precisely checking dependencies and promoting re-use. This paper introduces a domain-specific language for defining composable packages of higher order logic theories, which is designed to naturally handle the complex dependency structures that often arise in theory development. The package composition language functions as a module system for theories, and the paper presents a well-defined semantics for the supported operations. Preliminary tests of the package language and its toolset have been made by packaging the theories distributed with the HOL Light theorem prover. This experience is described, leading to some initial theory engineering discussion on the ideal properties of a reusable theory.

Keyphrases: higher order logic, package management, theory development

In: Markus Aderhold, Serge Autexier and Heiko Mantel (editors). VERIFY-2010. 6th International Verification Workshop, vol 3, pages 79-93.

Links:	https://easychair.org/publications/paper/zZV
	https://doi.org/10.29007/7gg3

BibTeX entry

@inproceedings{VERIFY-2010:Composable_Packages_Higher_Order,
  author    = {Joe Hurd},
  title     = {Composable Packages for Higher Order Logic Theories},
  booktitle = {VERIFY-2010. 6th International Verification Workshop},
  editor    = {Markus Aderhold and Serge Autexier and Heiko Mantel},
  series    = {EPiC Series in Computing},
  volume    = {3},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/zZV},
  doi       = {10.29007/7gg3},
  pages     = {79-93},
  year      = {2012}}

Download PDF Open PDF in browser