237 search results - page 29 / 48 » Coercions in a polymorphic type system |
CSL
2008
Springer
13 years 10 months ago
2008
Springer
Type-based termination is a semantically intuitive method that ensures termination of recursive definitions by tracking the size of datatype elements, and by checking that recursiv...
POPL
1998
ACM
14 years 1 months ago
1998
ACM
Java is typically compiled into an intermediate language, JVML, that is interpreted by the Java Virtual Machine. Because mobile JVML code is not always trusted, a bytecode verifi...
ICFP
2006
ACM
14 years 8 months ago
2006
ACM
We present language mechanisms for polymorphic, extensible records and their exact dual, polymorphic sums with extensible first-class cases. These features make it possible to eas...
APLAS
2004
ACM
14 years 16 days ago
2004
ACM
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher-order programs. The ...
CSL
2004
Springer
14 years 2 months ago
2004
Springer
Subtyping rules can be fairly complex for union types, due to interactions with other types, such as function types. Furthermore, these interactions turn out to depend on the calc...