When we extend a type system, the relation between the original system and its extension is an important issue we want to know. Conservative extension is a traditional relation we study with. But in some cases, like coercive subtyping, it is not strong enough to capture all the properties, more powerful relation between the systems is required. We bring the idea definitional extension from mathematical logic into type theory. In this paper, we study the notion of definitional extension for type theories and explicate its use, both informally and formally, in the context of coercive subtyping
In this paper we study subtyping for inductive types in dependent type theories in the farmework of ...
In this paper we study subtyping for inductive types in dependent type theories in the farmework of ...
In this paper we study subtyping for inductive types in dependent type theories in the farmework of ...
Coercive subtyping is a useful and powerful framework of subtyping for type theories. The key idea o...
International audienceCoercive subtyping is a useful and powerful framework of subtyping for type th...
In the formal semantics based on modern type theories, common nouns are interpreted as types, rather...
Abstract In the formal semantics based on modern type theories, common nouns are interpreted as type...
ESSLLI summer school in Ljubljana, Slovenia. The first three lectures of the course will be given by...
AbstractThis paper reports preliminary work on a novel approach to Coercive Subtyping that is based ...
We present a second-order λ-calculus with coercion constraints that generalizes a previous extension...
AbstractA notion of dependent coercion is introduced and studied in the context of dependent type th...
Abstract — We present a second-order λ-calculus with coercion constraints that generalizes a previou...
Subtype universes were initially introduced as an expressive mechanisation of bounded quantification...
International audienceWe present a second-order λ-calculus with coercion constraints that generalize...
In this paper we study subtyping for inductive types in dependent type theories in the farmework of ...
In this paper we study subtyping for inductive types in dependent type theories in the farmework of ...
In this paper we study subtyping for inductive types in dependent type theories in the farmework of ...
In this paper we study subtyping for inductive types in dependent type theories in the farmework of ...
Coercive subtyping is a useful and powerful framework of subtyping for type theories. The key idea o...
International audienceCoercive subtyping is a useful and powerful framework of subtyping for type th...
In the formal semantics based on modern type theories, common nouns are interpreted as types, rather...
Abstract In the formal semantics based on modern type theories, common nouns are interpreted as type...
ESSLLI summer school in Ljubljana, Slovenia. The first three lectures of the course will be given by...
AbstractThis paper reports preliminary work on a novel approach to Coercive Subtyping that is based ...
We present a second-order λ-calculus with coercion constraints that generalizes a previous extension...
AbstractA notion of dependent coercion is introduced and studied in the context of dependent type th...
Abstract — We present a second-order λ-calculus with coercion constraints that generalizes a previou...
Subtype universes were initially introduced as an expressive mechanisation of bounded quantification...
International audienceWe present a second-order λ-calculus with coercion constraints that generalize...
In this paper we study subtyping for inductive types in dependent type theories in the farmework of ...
In this paper we study subtyping for inductive types in dependent type theories in the farmework of ...
In this paper we study subtyping for inductive types in dependent type theories in the farmework of ...
In this paper we study subtyping for inductive types in dependent type theories in the farmework of ...