Rewriting and call-time choice: The HO case



Downloads per month over past year

López-Fraguas, Francisco Javier and Rodríguez-Hortalá, Juan and Sánchez-Hernández, Jaime (2008) Rewriting and call-time choice: The HO case. In Functional and Logic Programming. Lecture Notes in Computer Science (4989). Springer, Berlin, pp. 147-162. ISBN 978-3-540-78968-0

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


Official URL:


It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approaches to reduction like ordinary term rewriting systems or A-calculus. The presence of HO features makes things more difficult, since reasoning principles that are essential in a standard (i.e., deterministic) functional setting, like extensionality, become wrong. In this paper we propose HOlet-rewriting, a notion of rewriting with local bindings that turns out to be adequate for programs with HO non-deterministic functions, as it is shown by strong equivalence results with respect to HOCRWL, a previously existing semantic framework for such programs. In addition, we give a sound and complete notion of HO-let-narrowing, we show by a case study the usefulness of the achieved combination of semantic and reduction notions, and finally we prove within our framework that a standard approach to the implementation of HO features, namely translation to FO, is still valid for HO nondeterministic functions.

Item Type:Book Section
Additional Information:

9th international symposium, FLOPS 2008, Ise, Japan, April 14–16, 2008

Subjects:Sciences > Computer science > Programming languages (Electronic computers)
ID Code:18016
Deposited On:30 Jan 2013 09:58
Last Modified:29 Jun 2018 11:08

Origin of downloads

Repository Staff Only: item control page