120 search results - page 2 / 24 » New completeness results for lazy conditional narrowing |
WADT
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are ofte...
PLILP
1994
Springer
13 years 9 months ago
1994
Springer
Abstract. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the lan...
AAAI
2012
11 years 7 months ago
2012
The study of transportability aims to identify conditions under which causal information learned from experiments can be reused in a different environment where only passive obser...
AGP
1997
IEEE
13 years 9 months ago
1997
IEEE
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
PLILP
1997
Springer
13 years 9 months ago
1997
Springer
We introduce a framework for managing as a whole the space of a narrowing computation. The aim of our framework is to find a finite representation of an infinite narrowing space...