13 search results - page 2 / 3 » The Complexity of Type Inference for Higher-Order Typed Lamb... |
FSTTCS
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. Synchronous languages are well suited for the design of dependable real-time systems: they enable a very high-level specification and an extremely modular implementation ...
TCS
2008
13 years 5 months ago
2008
Intersection types are well-known to type theorists mainly for two reasons. Firstly, they type all and only the strongly normalizable lambda terms. Secondly, the intersection type...
DAGSTUHL
1996
13 years 6 months ago
1996
Abstract. Two-level -calculi have been heavily utilised for applications such as partial evaluation, abstract interpretation and code generation. Each of these applications pose di...
CSL
2004
Springer
13 years 10 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...
ICFP
2005
ACM
14 years 5 months ago
2005
ACM
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...