Narrowing for First Order Functional Logic Programs with Call-Time Choice Semantics



Downloads per month over past year

López-Fraguas, Francisco and Rodríguez-Hortalá, Juan and Sánchez-Hernández,, Jaime (2009) Narrowing for First Order Functional Logic Programs with Call-Time Choice Semantics. In APPLICATIONS OF DECLARATIVE PROGRAMMING AND KNOWLEDGE MANAGEMENT. Lecture Notes in Computer Science (5437). Springer, Berlin, pp. 206-222. ISBN 978-3-642-00674-6

[thumbnail of RodHotala04.pdf] PDF
Restringido a Repository staff only


Official URL:


In a recent work we have proposed let-rewriting, a simple one-step relation close to ordinary term rewriting but able, via local bindings, to express sharing of computed values. In this way, let-rewriting reflects the call-time choice semantics for non-determinism adopted by modern functional logic languages, where programs are rewrite systems possibly non-confluent and non-terminating. In this paper we extend that work providing a notion of let-narrowing which is adequate for call-time choice as proved by soundness and completeness results of let-narrowing with respect to let-rewriting. Completeness is based on a lifting lemma for let-rewriting similar to Hullot's lifting lemma for ordinary rewriting and narrowing. Our work copes with first order, left linear, constructor-based rewrite systems with no other restrictions about confluence, termination or presence of extra variables in right-hand sides of rules.

Item Type:Book Section
Additional Information:

17th International Conference, INAP 2007, and 21st Workshop on Logic Programming, WLP 2007, Würzburg, Germany, October 4-6, 2007

Subjects:Sciences > Computer science > Programming languages (Electronic computers)
ID Code:17994
Deposited On:29 Jan 2013 09:50
Last Modified:29 Jun 2018 11:01

Origin of downloads

Repository Staff Only: item control page