Proof assistants based on type theory such as Coq or Lego, putemphasis on inductive specifications and proofs by featuringexpressive inductive types. It isfrequent to modify an existing specification or proof by adding ormodifying constructors in inductive types. In the context of language design,adding constructors is a common practice to make progress step-by-step.In this article, we propose amechanism to extend and parameter inductive types, and aproof reuse mechanism founded on proof terms reuse
This document presents a panorama of representations of inductive definitions in proof assistants ba...
Rewriting is an essential tool for computer-based reasoning, both automated and assisted. This is be...
Type theories can provide a foundational account of constructive mathematics, and for the computer s...
International audienceDependent Type Theory as implemented into proof assistants and programming lan...
This dissertation deals with constructive languages: languages for the formal expression of mathemat...
Formalizing meta-theory, or proofs about programming languages, in a proof assistant has many well-k...
International audienceWhen one wants to design a language and related supporting tools, two distinct...
When one wants to design a language and related supporting tools, two distinct technical spaces can ...
Article dans revue scientifique avec comité de lecture.This paper presents the design, the implement...
Rapport interne.This paper presents the design, the implementation and experiments of the integratio...
Formalizing meta-theory, or proofs about programming languages, in a proof assistant has many well-k...
(extended abstract of the doctoral thesis) The thesis presents an ML-style module system for a proof...
Dependently typed languages such as Coq and Agda can statically guarantee the correctness of our pro...
Logic grammar is used to partly define a formal mathematical language “ADAM”, that keeps close to in...
Meseguer and Rosu proposed rewriting logic semantics (RLS) as a programming language definitional fr...
This document presents a panorama of representations of inductive definitions in proof assistants ba...
Rewriting is an essential tool for computer-based reasoning, both automated and assisted. This is be...
Type theories can provide a foundational account of constructive mathematics, and for the computer s...
International audienceDependent Type Theory as implemented into proof assistants and programming lan...
This dissertation deals with constructive languages: languages for the formal expression of mathemat...
Formalizing meta-theory, or proofs about programming languages, in a proof assistant has many well-k...
International audienceWhen one wants to design a language and related supporting tools, two distinct...
When one wants to design a language and related supporting tools, two distinct technical spaces can ...
Article dans revue scientifique avec comité de lecture.This paper presents the design, the implement...
Rapport interne.This paper presents the design, the implementation and experiments of the integratio...
Formalizing meta-theory, or proofs about programming languages, in a proof assistant has many well-k...
(extended abstract of the doctoral thesis) The thesis presents an ML-style module system for a proof...
Dependently typed languages such as Coq and Agda can statically guarantee the correctness of our pro...
Logic grammar is used to partly define a formal mathematical language “ADAM”, that keeps close to in...
Meseguer and Rosu proposed rewriting logic semantics (RLS) as a programming language definitional fr...
This document presents a panorama of representations of inductive definitions in proof assistants ba...
Rewriting is an essential tool for computer-based reasoning, both automated and assisted. This is be...
Type theories can provide a foundational account of constructive mathematics, and for the computer s...