1626 search results - page 32 / 326 » Subtyping with Power Types |
APAL
2005
13 years 7 months ago
2005
Systems of explicit mathematics provide an axiomatic framework to represent programs and to prove properties of them. We introduce such a system with a new form of power types usi...
POPL
1995
ACM
13 years 11 months ago
1995
ACM
We show how a set of building blocks can be used to construct programming language interpreters, and present implementations of such building blocks capable of supporting many com...
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
We propose a type system MLFthat generalizes ML with first-class polymorphism as in System F. Expressions may contain secondorder type annotations. Every typable expression admits...
TLCA
2001
Springer
14 years 4 days 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...
CORR
2012
Springer
12 years 3 months 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 ...