16 search results - page 3 / 4 » Common Subexpressions Are Uncommon in Lazy Functional Langua... |
FROCOS
2000
Springer
13 years 9 months ago
2000
Springer
This paper describes a high-level implementation of the concurrent constraint functional logic language Curry. The implementation, directed by the lazy pattern matching strategy of...
ML
2008
ACM
13 years 5 months ago
2008
ACM
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
LFP
1994
13 years 7 months ago
1994
We present a method, adapted to polymorphically typed functional languages, to detect and collect more garbage than existing GCs. It can be applied to strict or lazy higher order ...
ECOOP
1999
Springer
13 years 10 months ago
1999
Springer
Although it is acknowledged that internal iterators are easier and safer to use than conventional external iterators, it is commonly assumed that they are not applicable in languag...
ICFP
2007
ACM
13 years 9 months ago
2007
ACM
In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a very high level of abstraction. Work flow systems are au...