The use of interactive theorem provers to establish the correctness of critical parts of a
software development or for formalizing mathematics is becoming more common and …

Sized types have been developed to make termination checking more perspicuous, more
powerful, and more modular by integrating termination into type checking. In dependently …

We present a Coq formalization of the normalization-by-evaluation algorithm for Martin-Löf
dependent type theory with one universe and judgmental equality. The end results of the …

Martin-Löf type theory is a formal system for the development of constructive mathematics
and a very expressive functional programming language. In this language, it is possible to …

We present the Braga method which we use to get verified OCaml programs by extraction
from fully specified Coq terms. Unlike structural recursion which is accepted as is by Coq …

Simulating Induction-Recursion for Partial Algorithms Page 1 HAL Id: hal-02333374 https://hal.science/hal-02333374
Submitted on 25 Oct 2019 HAL is a multi-disciplinary open access archive for the deposit …

This thesis studies the problem of structure-aware revision control, which consists of
exploiting the knowledge of the structure of data to improve the quality of version control …

In the process of describing systems and their properties, users of proof assistants introduce
not only recursive datatypes, but also sets constructed by a recursive process. These sets …

Bove and Capretta's popular method for justifying function definitions by general recursive
equations is based on the observation that any structured general recursion equation …