Published August 16, 2016 | Version v1
Conference paper Open

A Qualitative Analysis of Kernel Extension for Higher Order Proof Checking

  • 1. ROR icon Institut national de recherche en informatique et en automatique

Contributors

Researcher:

Supervisor:

  • 1. ROR icon Institut national de recherche en informatique et en automatique
  • 2. ROR icon École Polytechnique

Description

For the sake of reliability, the kernels of Interactive Theorem Provers (ITPs) are kept relatively small in general. On top of the kernel, additional symbols and inference rules are defined. This paper presents the first qualitative analysis of how kernel extension reduces the size of proofs and its impact on proof checking. 

Files

holala-master (1).zip

Files (6.6 MB)

Name Size Download all
md5:c7c564698a50fd37a496b040f8b27052
6.3 MB Preview Download
md5:01b7c6505bbe900aebf726c3850f630b
284.0 kB Preview Download

Additional details

Related works

Continues
Conference paper: 10.5281/zenodo.10629598 (DOI)
Is part of
Report: 10.5281/zenodo.10624347 (DOI)

Dates

Available
2016-08-16

Software

Repository URL
https://github.com/airobert/holala
Programming language
OCaml