English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Efficient Implementation of Narrowing and Rewriting

MPS-Authors
There are no MPG-Authors in the publication available
External Resource

https://rdcu.be/dtiyc
(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Hanus, M. (1991). Efficient Implementation of Narrowing and Rewriting. In H. Boley, & M. Richter (Eds.), Processing Declarative Knowledge (pp. 344‒365). Berlin: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0023-C350-0
Abstract
We present an efficient implementation method for a language that amalgamates functional and logic programming styles. The operational semantics of the language consists of resolution to solve predicates and narrowing and rewriting to evaluate functional expressions. The implementation is based on an extension of the Warren Abstract Machine (WAM). This extension causes no overhead for pure logic programs and allows the execution of functional programs by narrowing and rewriting with the same efficiency as their relational equivalents. Moreover, there are many cases where functional programs are more efficiently executed than their relational equivalents.