Sciweavers

85 search results - page 8 / 17
» Specialization of Lazy Functional Logic Programs
Sort
View
PLILP
1993
Springer
13 years 12 months ago
A Demand Driven Computation Strategy for Lazy Narrowing
Many recent proposals for the integration of functional and logic programming use conditional term rewriting systems (CTRS) as programs and narrowing as goal solving mechanism. Thi...
Rita Loogen, Francisco Javier López-Fraguas...
IFL
2005
Springer
116views Formal Methods» more  IFL 2005»
14 years 1 months ago
Proof Tool Support for Explicit Strictness
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
Marko C. J. D. van Eekelen, Maarten de Mol
ICLP
1997
Springer
13 years 12 months ago
Parallel Evaluation Strategies for Functional Logic Languages
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...
Sergio Antoy, Rachid Echahed, Michael Hanus
GI
1997
Springer
14 years 2 hour ago
Functional Object-Oriented Programming with Object-Gofer
Object-Gofer is a small, practical extension of the functional programming language Gofer incorporating the following ideas from the object-oriented community: objects and toplevel...
Wolfram Schulte, Klaus Achatz
LICS
1994
IEEE
13 years 12 months ago
Higher-Order Narrowing
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
Christian Prehofer