FLOPS
2008
Springer
14 years 1 months ago
2008
Springer
Narrowing extends rewriting with logic capabilities by allowing free variables in terms and replacing matching with unification. Narrowing has been widely used in different context...
POPL
1997
ACM
14 years 3 months ago
1997
ACM
We propose a new computation model which combines the operational principles of functional languages (reduction), logic languages (non-deterministic search for solutions), and int...
ZUM
2000
Springer
14 years 3 months ago
2000
Springer
We present a computation model for Z, which is based on a reduction to a small calculus, called Z, and on concurrent constraint resolution techniques applied for computing in thi...
WFLP
2000
Springer
14 years 3 months ago
2000
Springer
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
FROCOS
2000
Springer
14 years 3 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...
AGP
1997
IEEE
14 years 3 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 ...
ICFP
1999
ACM
14 years 3 months ago
1999
ACM
Functional logic languages combine the operational principles of the most important declarative programming paradigms, namely functional and logic programming. Inductively sequent...
PPDP
2001
Springer
14 years 3 months ago
2001
Springer
This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in pa...
LOPSTR
2005
Springer
14 years 5 months ago
2005
Springer
We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns...
LOPSTR
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...