The paper describes the new kernel for the Calculus of Inductive Constructions (CIC) implemented inside the Matita Interactive Theorem Prover. The design of the new kernel has been completely revisited since the first release, resulting in a remarkably compact implementation of about 2300 lines of OCaml code. The work is meant for people interested in implementation aspects of Interactive Provers, and is not self contained. In particular, it requires good acquaintance with Type Theory and functional programming languages.
A.Asperti, W.Ricciotti, C.Sacerdoti Coen, E.Tassi (2009). A compact kernel for the calculus of inductive constructions. SADHANA (BANGALORE), 34, 71-144 [10.1007/s12046-009-0003-3].
A compact kernel for the calculus of inductive constructions
ASPERTI, ANDREA;RICCIOTTI, WILMER;SACERDOTI COEN, CLAUDIO;
2009
Abstract
The paper describes the new kernel for the Calculus of Inductive Constructions (CIC) implemented inside the Matita Interactive Theorem Prover. The design of the new kernel has been completely revisited since the first release, resulting in a remarkably compact implementation of about 2300 lines of OCaml code. The work is meant for people interested in implementation aspects of Interactive Provers, and is not self contained. In particular, it requires good acquaintance with Type Theory and functional programming languages.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
