4 search results - page 1 / 1 » A Modular Type-checking algorithm for Type Theory with Singl... |
CORR
2011
Springer
12 years 8 months ago
2011
Springer
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...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
Book
"These course notes are addressed to a wide audience of people interested in modern programming languages in general, ML-like languages in particular, or simply in OCaml, whet...
ENTCS
2008
13 years 4 months ago
2008
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...