8766 search results - page 14 / 1754 » Functional logic programming |
TOPLAS
1998
13 years 8 months ago
1998
TOCL
2010
13 years 7 months ago
2010
ENTCS
2007
13 years 8 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...
ALP
1997
Springer
14 years 29 days ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
LPAR
1999
Springer
14 years 1 months ago
1999
Springer
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays...