When one wants to design a language and related supporting tools, two distinct technical spaces can be considered. On the one hand, model-driven tools like Xtext or MPS automatically provide a compilation infrastructure and a full-featured integrated development environment. On the other hand, a formal workbench like a proof assistant helps in the design and verification of the language specification. But these two technical spaces can hardly be used in conjunction. In the paper, we propose an automatic transformation that takes an input Ecore metamodel, and generates a set of inductive types in Gallina and Vernacular, the language of the Coq proof assistant. By doing so, it is guaranteed that the same abstract syntax as the one described b...
Formal reasoning in proof assistants, also known as mechanization, has high development costs. Build...
AbstractWe describe a proof dedicated meta-language, called L tac, in the context of t...
(extended abstract of the doctoral thesis) The thesis presents an ML-style module system for a proof...
International audienceWhen one wants to design a language and related supporting tools, two distinct...
International audienceWhen engineering a language (and its compiler), it is convenient to use widesp...
The work presented in this paper lies in the context of implementing supporting tools for a domain-s...
Formalizing meta-theory, or proofs about programming languages, in a proof assistant has many well-k...
Formalizing meta-theory, or proofs about programming languages, in a proof assistant has many well-k...
We present discussions on how to apply a type-theoretic framework composed out by the Calculus of In...
Formalizing meta-theory, or proofs about programming languages, in a proof assistant has many well-k...
"This paper presents ongoing work on the application of constructive type theory for safe developmen...
Proof assistants based on type theory such as Coq or Lego, putemphasis on inductive specifications a...
"We present a framework based on the Calculus of Inductive Constructions (CIC) and its associated to...
Formalizing meta-theory, or proofs about programming languages, in a proof assistant has many well-k...
International audienceDependent Type Theory as implemented into proof assistants and programming lan...
Formal reasoning in proof assistants, also known as mechanization, has high development costs. Build...
AbstractWe describe a proof dedicated meta-language, called L tac, in the context of t...
(extended abstract of the doctoral thesis) The thesis presents an ML-style module system for a proof...
International audienceWhen one wants to design a language and related supporting tools, two distinct...
International audienceWhen engineering a language (and its compiler), it is convenient to use widesp...
The work presented in this paper lies in the context of implementing supporting tools for a domain-s...
Formalizing meta-theory, or proofs about programming languages, in a proof assistant has many well-k...
Formalizing meta-theory, or proofs about programming languages, in a proof assistant has many well-k...
We present discussions on how to apply a type-theoretic framework composed out by the Calculus of In...
Formalizing meta-theory, or proofs about programming languages, in a proof assistant has many well-k...
"This paper presents ongoing work on the application of constructive type theory for safe developmen...
Proof assistants based on type theory such as Coq or Lego, putemphasis on inductive specifications a...
"We present a framework based on the Calculus of Inductive Constructions (CIC) and its associated to...
Formalizing meta-theory, or proofs about programming languages, in a proof assistant has many well-k...
International audienceDependent Type Theory as implemented into proof assistants and programming lan...
Formal reasoning in proof assistants, also known as mechanization, has high development costs. Build...
AbstractWe describe a proof dedicated meta-language, called L tac, in the context of t...
(extended abstract of the doctoral thesis) The thesis presents an ML-style module system for a proof...