Sciweavers

24 search results - page 1 / 5
» A lazy narrowing calculus for declarative constraint program...
Sort
View
PPDP
2004
Springer
13 years 10 months ago
A lazy narrowing calculus for declarative constraint programming
The new generic scheme CFLP(D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given ...
Francisco Javier López-Fraguas, Mario Rodr&...
EUROCAST
2001
Springer
127views Hardware» more  EUROCAST 2001»
13 years 9 months ago
Higher-Order Lazy Narrowing Calculus: A Solver for Higher-Order Equations
Abstract. This paper introduces a higher-order lazy narrowing calculus (HOLN for short) that solves higher-order equations over the domain of simply typed λ-terms. HOLN is an exte...
Tetsuo Ida, Mircea Marin, Taro Suzuki
PLILP
1995
Springer
13 years 8 months ago
A Complete Narrowing Calculus for Higher-Order Functional Logic Programming
Abstract. Using higher-order functions is standard practice in functional programming, but most functional logic programming languages that have been described in the literature la...
Koichi Nakahara, Aart Middeldorp, Tetsuo Ida
PLILP
1994
Springer
13 years 9 months ago
Combining Lazy Narrowing with Disequality Constraints
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...
Puri Arenas-Sánchez, Ana Gil-Luezas, Franci...
CORR
2004
Springer
128views Education» more  CORR 2004»
13 years 4 months ago
Specialization of Functional Logic Programs Based on Needed Narrowing
Many functional logic languages are based on narrowing, a unification-based goal-solving mechanism which subsumes the reduction mechanism of functional languages and the resolutio...
María Alpuente, Michael Hanus, Salvador Luc...