20 search results - page 2 / 4 » icfp 2004 |
ICFP
2004
ACM
14 years 6 months ago
2004
ACM
We study a type system equipped with universal types and equirecursive types, which we refer to as F?. We show that type equality may be decided in time O(n log n), an improvement...
ICFP
2004
ACM
14 years 6 months ago
2004
ACM
Higher-order languages that encourage currying are implemented using one of two basic evaluation models: push/enter or eval/apply. Implementors use their intuition and qualitative...
ICFP
2004
ACM
14 years 6 months ago
2004
ACM
It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. This turns out to be a surprisingly useful mechanism. Thi...
ICFP
2004
ACM
14 years 6 months ago
2004
ACM
d Abstract) Dario Colazzo1 , Giorgio Ghelli2 , Paolo Manghi2 , and Carlo Sartiani2 1 LRI - Universit?e Paris Sud 2 Dipartimento di Informatica - Universit`a di Pisa If a subexpress...
ICFP
2004
ACM
14 years 6 months ago
2004
ACM
We present a process logic for the -calculus with the linear/affine type discipline (Berger et al. 2001; Berger et al. 2003; Honda and Yoshida 2002; Honda and Yoshida 2003; Honda ...