9 search results - page 2 / 2 » A Deterministic Lazy Narrowing Calculus |
ENTCS
2007
13 years 5 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...
RTA
2010
Springer
13 years 9 months ago
2010
Springer
This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-nee...
ICLP
1997
Springer
13 years 10 months ago
1997
Springer
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...
ICFP
2004
ACM
14 years 5 months ago
2004
ACM
Recent functional logic languages such as Curry and Toy combine lazy functional programming with logic programming features including logic variables, non-determinism, unification...