RT Book, Section
T1 On narrowing strategies for partial non-strict functions
A1 Frutos Escrig, David De
A1 Fernández Camacho, María Inés
A2 Abramsky, S.
A2 Maibaum, T.S.E.
AB We study completeness of narrowing strategies for a class of programs defining (possibly partial and non-strict) functions by means of equations, with a lazy semantics, so that infinite values are also admissible. We consider a syntactical restriction introduced by Echahed, under which he proved that any narrowing strategy is complete for specifications defining total functions with finite values. Unfortunately things are not so pretty for the larger class of programs that we consider. So we see that laziness of strategies is necessary in order to cope with non-strictness, fairness if we want to compute infinite values, and syntactically complete specifications (those including rules covering all possible patterns for each function) if we are also interested in the computation of partial values.
PB Springer
SN 978-3-540-53981-0
YR 1991
FD 1991
LK https://hdl.handle.net/20.500.14352/60653
UL https://hdl.handle.net/20.500.14352/60653
NO Frutos Escrig, D. & Fernández Camacho, M. I. «On narrowing strategies for partial non-strict functions». TAPSOFT ’91, editado por S. Abramsky y T. S. E. Maibaum, vol. 494, Springer Berlin Heidelberg, 1991, pp. 416-37. DOI.org (Crossref), https://doi.org/10.1007/3540539816_79.
DS Docta Complutense
RD 19 mar 2026