133 search results - page 5 / 27 » Benchmarking Implementations of Lazy Functional Languages |
ESOP
2012
Springer
12 years 3 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
ENTCS
2007
13 years 7 months ago
2007
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
DOCENG
2003
ACM
14 years 28 days ago
2003
ACM
We introduce a lazy XSLT interpreter that provides random access to the transformation result. This allows efficient pipelining of transformation sequences. Nodes of the result tr...
FPCA
1987
13 years 11 months ago
1987
: Categorical Multi-Combinators form a rewriting system developed with the aim of providing efficient implementations of lazy functional languages. The core of the system of Catego...
ENTCS
2002
13 years 7 months ago
2002
In this work we provide a semantic description of functional logic languages covering notions like laziness, sharing, and non-determinism. Such a semantic description is essential...