International audienceGradualizing the Calculus of Inductive Constructions (CIC) involves dealing with subtle tensions between normalization, graduality, and conservativity with respect to CIC. Recently, GCIC has been proposed as a parametrized gradual type theory that admits three variants, each sacrificing one of these properties. For devising a gradual proof assistant based on CIC, normalization and conservativity with respect to CIC are key, but the tension with graduality needs to be addressed. Additionally, several challenges remain: (1) The presence of two wildcard terms at any type-the error and unknown terms-enables trivial proofs of any theorem, jeopardizing the use of a gradual type theory in a proof assistant; (2) Supporting gen...
Siek and Taha [2006] coined the term gradual typing to describe a theory for integrating static and ...
In order to avoid well-known paradoxes associated with self-referential definitions, higher-order de...
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) i...
International audienceGradualizing the Calculus of Inductive Constructions (CIC) involves dealing wi...
To appearInternational audienceWe investigate gradual variations on the Calculus of Inductive Constr...
We present gradual type theory, a logic and type theory for call-by-name gradual typing. We define t...
Strong Normalization (SN) is an important property for intensional constructive type theories such a...
Having the type of all types in a type system results in paradoxes like Russel’s paradox. Therefore ...
International audienceThis article presents a bidirectional type system for the Calculus of Inductiv...
International audienceGradually typed languages allow statically typed and dynamically typed code to...
Gradually typed languages offer both static and dynamic checking of program invariants, from simple ...
We discuss our on-going research on making inductive types cumulative in the predicative calculus of...
International audienceBringing the benefits of gradual typing to a language with parametric polymorp...
Gradual typing is a discipline for integrating dynamic checking into a static type system. Since its...
International audienceTraditional approaches to compensate for the lack of exceptions in type theori...
Siek and Taha [2006] coined the term gradual typing to describe a theory for integrating static and ...
In order to avoid well-known paradoxes associated with self-referential definitions, higher-order de...
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) i...
International audienceGradualizing the Calculus of Inductive Constructions (CIC) involves dealing wi...
To appearInternational audienceWe investigate gradual variations on the Calculus of Inductive Constr...
We present gradual type theory, a logic and type theory for call-by-name gradual typing. We define t...
Strong Normalization (SN) is an important property for intensional constructive type theories such a...
Having the type of all types in a type system results in paradoxes like Russel’s paradox. Therefore ...
International audienceThis article presents a bidirectional type system for the Calculus of Inductiv...
International audienceGradually typed languages allow statically typed and dynamically typed code to...
Gradually typed languages offer both static and dynamic checking of program invariants, from simple ...
We discuss our on-going research on making inductive types cumulative in the predicative calculus of...
International audienceBringing the benefits of gradual typing to a language with parametric polymorp...
Gradual typing is a discipline for integrating dynamic checking into a static type system. Since its...
International audienceTraditional approaches to compensate for the lack of exceptions in type theori...
Siek and Taha [2006] coined the term gradual typing to describe a theory for integrating static and ...
In order to avoid well-known paradoxes associated with self-referential definitions, higher-order de...
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) i...