This thesis introduces an extension of the Calculus of Constructions of Coquand and Huet which allows the extraction of certified programs from constructive proofs. A modified realisability notion is introduced and its properties are studied. An impredicative encoding of a large class of inductive definitions is proposed.Cette thèse propose une extension du Calcul des Constructions de Coquand et Huet qui permet l'extraction de programmes certifiés à partir de preuve constructive. Une notion de réalisabilité modifiée est introduite et étudiée. Un codage imprédicatif d'une large classe de définitions inductives est proposé
We prove the correctness of a formalised realisability interpretation of extensions of first-order t...
International audienceWe investigate here a new version of the Calculus of Inductive Constructions (...
Proof assistants based on dependent type theory are gaining adoption as a tool to develop certified ...
This thesis introduces an extension of the Calculus of Constructions of Coquand and Huet which allow...
This work concerns the generation of programs which are certifiedto be correct by construction. Thes...
The Coq proof assistant mechanically checks the consistency of the logical reasoning in a proof. It ...
Based on the Calculus of Constructions extended with inductive definitions we present a Theory of Sp...
The goal of this thesis is to develop a logical system in which formal proofs of mathematical statem...
The objective of this paper is to provide a theoretical foundation for program extraction from proof...
This paper presents how to automatically prove that an "optimized " program is correct wit...
Nous étudions ici la génération de programmes certifiés corrects par construction. Ces programmes so...
Executable codes can be extracted from constructive proofs by using realizability interpretation. Ho...
Abstract. We show how to extract classical programs expressed in Krivine λc-calculus from proof-term...
This dissertation deals with constructive languages: languages for the formal expression of mathemat...
The topic of this thesis is the extraction of efficient and readable programs from formal constructi...
We prove the correctness of a formalised realisability interpretation of extensions of first-order t...
International audienceWe investigate here a new version of the Calculus of Inductive Constructions (...
Proof assistants based on dependent type theory are gaining adoption as a tool to develop certified ...
This thesis introduces an extension of the Calculus of Constructions of Coquand and Huet which allow...
This work concerns the generation of programs which are certifiedto be correct by construction. Thes...
The Coq proof assistant mechanically checks the consistency of the logical reasoning in a proof. It ...
Based on the Calculus of Constructions extended with inductive definitions we present a Theory of Sp...
The goal of this thesis is to develop a logical system in which formal proofs of mathematical statem...
The objective of this paper is to provide a theoretical foundation for program extraction from proof...
This paper presents how to automatically prove that an "optimized " program is correct wit...
Nous étudions ici la génération de programmes certifiés corrects par construction. Ces programmes so...
Executable codes can be extracted from constructive proofs by using realizability interpretation. Ho...
Abstract. We show how to extract classical programs expressed in Krivine λc-calculus from proof-term...
This dissertation deals with constructive languages: languages for the formal expression of mathemat...
The topic of this thesis is the extraction of efficient and readable programs from formal constructi...
We prove the correctness of a formalised realisability interpretation of extensions of first-order t...
International audienceWe investigate here a new version of the Calculus of Inductive Constructions (...
Proof assistants based on dependent type theory are gaining adoption as a tool to develop certified ...