Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Optimal Non-Deterministic Functional Logic Computations ?
 

Summary: Optimal Non-Deterministic
Functional Logic Computations ?
Sergio Antoy
Portland State University
Abstract. We show that non-determinism simpli es coding certain prob-
lems into programs. We de ne a non-con uent, but well-behaved class of
rewrite systems for supporting non-deterministic computations in functional
logic programming. We show the bene ts of using this class on a few examples.
We de ne a narrowing strategy for this class of systems and prove that our
strategy is sound, complete, and optimal, modulo non-deterministic choices,
for appropriate de nitions of these concepts. We compare our strategy with
related work and show that our overall approach is fully compatible with the
current proposal of a universal, broad-based functional logic language.
1 Introduction
Curry [4], a recently proposed, general-purpose, broad-based functional logic lan-
guage, o ers lazy evaluation, higher order functions, non-deterministic choices, and a
uni ed computation model which integrates narrowing and residuation. Curry models
functions by the de ned operations of a constructor-based, almost orthogonal, term
rewriting system (CAT ). Non-determinism occurs typically in three situations: when
variables are instantiated during a narrowing step; when certain arguments of a non-

  

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

 

Collections: Computer Technologies and Information Sciences