128 search results - page 1 / 26 » Extensible encoding of type hierarchies |
POPL
2008
ACM
14 years 4 months ago
2008
ACM
The subtyping test consists of checking whether a type t is a descendant of a type r (Agrawal et al. 1989). We study how to perform such a test efficiently, assuming a dynamic hie...
TACS
1991
Springer
13 years 7 months ago
1991
Springer
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...
DATE
2008
IEEE
13 years 10 months ago
2008
IEEE
Compositional Scheduling Analysis couples local scheduling analysis via event streams. While local analysis has successfully been extended to include hierarchical scheduling strat...
HASKELL
2006
ACM
13 years 10 months ago
2006
ACM
In this paper we address the lack of extensibility of the exception type in Haskell. We propose a lightweight solution involving the use of existential types and the Typeable clas...
ECOOP
1997
Springer
13 years 8 months ago
1997
Springer
A type inclusion test is a procedure to decide whether two types are related by a given subtyping relationship. An efficient implementation of the type inclusion test plays an impo...