Sciweavers

24 search results - page 4 / 5
» Preserving Sharing in the Partial Evaluation of Lazy Functio...
Sort
View
FROCOS
2000
Springer
15 years 1 months ago
Compiling Multi-Paradigm Declarative Programs into Prolog
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...
Sergio Antoy, Michael Hanus
LICS
1994
IEEE
15 years 1 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
ENTCS
2002
83views more  ENTCS 2002»
14 years 9 months ago
Operational Semantics for Functional Logic Languages
In this work we provide a semantic description of functional logic languages covering notions like laziness, sharing, and non-determinism. Such a semantic description is essential...
Elvira Albert, Michael Hanus, Frank Huch, Javier O...
FPCA
1995
15 years 1 months ago
Once Upon a Type
A number of useful optimisations are enabled if we can determine when a value is accessed at most once. We extend the Hindley-Milner type system with uses, yielding a typeinferenc...
David N. Turner, Philip Wadler, Christian Mossin
AGP
1997
IEEE
15 years 1 months ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...