21 search results - page 1 / 5 » Refinement Types as Proof Irrelevance |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...
TLCA
2009
Springer
13 years 9 months ago
2009
Springer
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...
CADE
2006
Springer
14 years 5 months ago
2006
Springer
We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlyi...
ISSE
2010
12 years 11 months ago
2010
In this work, we address the formalisation of symmetric nets, a subclass of coloured Petri nets, refinement in COQ. We first provide a formalisation of the net models, and of thei...