ICFP
2004
ACM
14 years 5 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 5 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 5 months ago
2004
ACM
This paper presents an approach to searching for deadlocks in Concurrent Haskell programs. The search is based on a redefinition of the IO monad which allows the reversal of Concu...
ICFP
2004
ACM
14 years 5 months ago
2004
ACM
ICFP
2004
ACM
14 years 5 months ago
2004
ACM
ICFP
2004
ACM
14 years 5 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
ICFP
2004
ACM
14 years 5 months ago
2004
ACM
We extend Haskell with regular expression patterns. Regular expression patterns provide means for matching and extracting data which goes well beyond ordinary pattern matching as ...
ICFP
2004
ACM
14 years 5 months ago
2004
ACM
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
ICFP
2004
ACM
14 years 5 months ago
2004
ACM
Among slide-presentation systems, the dominant application offers lly no abstraction capability. Slideshow, an extension of PLT Scheme, represents our effort over the last several...
ICFP
2004
ACM
14 years 5 months ago
2004
ACM
