A Call-by-Need Strategy for Higher-Order Functional-Logic Programming (1995)
Cached
Download Links
- [www4.in.tum.de]
- [www4.informatik.tu-muenchen.de]
- [wwwbroy.informatik.tu-muenchen.de]
- [www4.informatik.tu-muenchen.de]
- DBLP
Other Repositories/Bibliography
| Venue: | LOGIC PROGRAMMING. PROC. OF THE 1995 INTERNATIONAL SYMPOSIUM |
| Citations: | 11 - 5 self |
BibTeX
@INPROCEEDINGS{Prehofer95acall-by-need,
author = {Christian Prehofer},
title = {A Call-by-Need Strategy for Higher-Order Functional-Logic Programming},
booktitle = {LOGIC PROGRAMMING. PROC. OF THE 1995 INTERNATIONAL SYMPOSIUM},
year = {1995},
pages = {147--161},
publisher = {MIT Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present an approach to truely higher-order functional-logic programming based on higher-order narrowing. Roughly speaking, we model a higherorder functional core language by higher-order rewriting and extend it by logic variables. For the integration of logic programs, conditional rules are supported. For solving goals in this framework, we present a complete calculus for higher-order conditional narrowing. We develop several refinements that utilize the determinism of functional programs. These refinements can be combined to a narrowing strategy which generalizes call-by-need as in functional programming, where the dedicated higher-order methods are only used for full higher-order goals. Furthermore, we propose an implementational model for this narrowing strategy which delays computations until needed.
