Browse by Discipline
Functional Logic Computations?
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
rewrite systems for supporting non-deterministic computations in functional
Source: Antoy, Sergio - Department of Computer Science, Portland State University
Collections: Computer Technologies and Information Sciences