ICFP
2002
ACM
14 years 7 months ago
2002
ACM
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
Generational collection has improved the efficiency of garbage collection in fast-allocating programs by focusing on collecting young garbage, but has done little to reduce the co...
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
We present a direct implementation of the shift and reset control operators in the Scheme 48 system. The new implementation improves upon the traditional technique of simulating s...
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
This paper presents a monadic approach to incremental computation, suitable for purely functional languages such as Haskell. A program that uses incremental computation is able to...