Partiality and Recursion in Interactive Theorem Provers - An Overview - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Mathematical Structures in Computer Science Year : 2012

Partiality and Recursion in Interactive Theorem Provers - An Overview


The use of interactive theorem provers to establish the correctness of critical parts of a software development or for formalising mathematics is becoming more common and feasible in practice. However, most mature theorem provers lack a direct treatment of partial and general recursive functions; overcoming this weakness has been the objective of intensive research during the last decades. In this article, we review many techniques that have been proposed in the literature to simplify the formalisation of partial and general recursive functions in interactive theorem provers. Moreover, we classify the techniques according to their theoretical basis and their practical use. This uniform presentation of the different techniques facilitates the comparison and highlights their commonalities and differences, as well as their relative advantages and limitations. We focus on theorem provers based on constructive type theory (in particular, Agda and Coq) and higher-order logic (in particular Isabelle/HOL). Other systems and logics are covered to a certain extent, but not exhaustively. In addition to the description of the techniques, we also demonstrate tools which facilitate working with the problematic functions in particular theorem provers.
Fichier principal
Vignette du fichier
main.pdf (419.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00691459 , version 1 (26-10-2012)


  • HAL Id : hal-00691459 , version 1


Ana Bove, Alexander Krauss, Matthieu Sozeau. Partiality and Recursion in Interactive Theorem Provers - An Overview. Mathematical Structures in Computer Science, 2012. ⟨hal-00691459⟩
258 View
408 Download


Gmail Facebook Twitter LinkedIn More