Universidad Complutense de Madrid
E-Prints Complutense

On narrowing strategies for partial non-strict functions



Último año

Frutos Escrig, David de y Fernández Camacho, María Inés (1991) On narrowing strategies for partial non-strict functions. In TAPSOFT '91: Proceedings of the International Joint Conference on Theory and Practice of Software Development Brighton, UK, April 8–12, 1991. Lecture notes in computer science (494). Springer, pp. 416-437. ISBN 978-3-540-53981-0

URL Oficial: http://link.springer.com/chapter/10.1007%2F3540539816_79?LI=true

URLTipo de URL


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.

Tipo de documento:Sección de libro
Materias:Ciencias > Informática
Código ID:20617
Depositado:01 Abr 2013 15:16
Última Modificación:01 Abr 2013 15:16

Descargas en el último año

Sólo personal del repositorio: página de control del artículo