Summary:  6th Int'l Conf. on Algebraic and Logic Programming (ALP'97),
Southampton, UK, Sept. 1997, Springer LNCS Vol. 1298, pages 16-30.



Optimal Non-Deterministic

Functional Logic Computations?



Sergio Antoy


Portland State University



Abstract.We show that non-determinism simplifies coding certain prob-
lems into programs. We define a non-confluent, but well-behaved class of

Source: Antoy, Sergio - Department of Computer Science, Portland State University

Collections: Computer Technologies and Information Sciences