Sciweavers

68 search results - page 1 / 14
» Strong Normalization with Singleton Types
Sort
View
ENTCS
2002
80views more  ENTCS 2002»
13 years 4 months ago
Strong Normalization with Singleton Types
This paper presents a new lambda-calculus with singleton types, called {}. The main novelty of
Judicaël Courant
CORR
2011
Springer
170views Education» more  CORR 2011»
12 years 8 months ago
A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance
We define a logical framework with singleton types and one universe of small types. We give the semantics using a PER model; it is used for constructing a normalisation-by-evaluat...
Andreas Abel, Thierry Coquand, Miguel Pagano
TCS
2008
13 years 4 months ago
On strong normalization and type inference in the intersection type discipline
We introduce a new unification procedure for the type inference problem in the intersection type discipline. It is well known that type inference in this case should succeed exact...
Gérard Boudol
TIC
2000
Springer
124views System Software» more  TIC 2000»
13 years 8 months ago
Sound and Complete Elimination of Singleton Kinds
Singleton kinds provide an elegant device for expressing type equality information resulting from modern module languages, but they can severely complicate the metatheory of langu...
Karl Crary