| | |
Summary: 10th International Workshop on Functional and Logic Programming
and 16th Workshop on Logic Programming (WFLP'01)
Kiel, Germany, Sept. 2001, pages 17-30.
Improving the EÆciency of
Non-Deterministic Computations
Sergio Antoy 1 Pascual Julian Iranzo 2;3 Bart Massey 1
Computer Science Department
Portland State University
Portland, Oregon
{antoy,pjulian,bart}@cs.pdx.edu
Abstract. Non-deterministic computations greatly enhance the expres-
sive power of functional logic programs, but are often computationally
expensive. We analyze two programming techniques that improve the
time and memory eÆciency of some non-deterministic computations.
These techniques rely on the introduction of a new symbol into the sig-
nature of a program. In one technique this symbol is a polymorphic
de ned operation, in the other an overloaded constructor. Our program-
ming techniques may save execution time by reducing the number of
steps of a computation, as well as memory occupation, by reducing the
number of terms constructed by a computation. We show how to apply
|
