39 search results - page 1 / 8 » A Calculus for Type Predicates and Type Coercion |
TABLEAUX
2005
Springer
13 years 10 months ago
2005
Springer
We extend classical first-order logic with subtyping by type predicates and type coercion. Type predicates assert that the value of a term belongs to a more special type than the ...
EACL
1993
ACL Anthology
13 years 5 months ago
1993
ACL Anthology
The interpretation of coercion constructions (to begin a book) has been recently considered as resulting from the operation of type changing. For instance, a phrase of type o (obj...
ESOP
2009
Springer
13 years 11 months ago
2009
Springer
This paper explores the surprisingly rich design space for the simply typed lambda calculus with casts and a dynamic type. Such a calculus is the target intermediate language of th...
POPL
2010
ACM
14 years 1 months ago
2010
ACM
Abstract. The blame calculus of Wadler and Findler gives a high-level semantics to casts in higher-order languages. The coercion calculus of Henglein, on the other hand, provides a...
MFCS
2010
Springer
13 years 2 months ago
2010
Springer
We provide a strong normalization result for MLF , a type system generalizing ML with first-class polymorphism as in system F. The proof is achieved by translating MLF into a calc...