19 search results - page 1 / 4 » Coercive subtyping for the calculus of constructions |
POPL
2003
ACM
14 years 5 months ago
2003
ACM
CORR
2012
Springer
12 years 15 days ago
2012
Springer
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
LICS
2000
IEEE
13 years 9 months ago
2000
IEEE
While Game Semantics has been remarkably successful at g, often in a fully abstract manner, a wide range of features of programming languages, there has to date been no attempt at...
17
Voted
TLCA
2001
Springer
13 years 9 months ago
2001
Springer
In this paper, we introduce a new type system, the Implicit Calculus of Constructions, which is a Curry-style variant of the Calculus of Constructions that we extend by adding an i...
ICFP
1997
ACM
13 years 9 months ago
1997
ACM
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...