| | |
Summary: Implementing Functional Logic Languages
Using Multiple Threads and Stores
Andrew Tolmach
apt@cs.pdx.edu
Sergio Antoy
antoy@cs.pdx.edu
Marius Nita
marius@cs.pdx.edu
Dept. of Computer Science, Portland State University
P.O.Box 751, Portland, OR 97201
Abstract
Recent functional logic languages such as Curry and Toy combine
lazy functional programming with logic programming features in-
cluding logic variables, non-determinism, unification, narrowing,
fair search, concurrency, and residuation. In this paper, we show
how to extend a conventional interpreter for a lazy functional lan-
guage to handle these features by adding support for reference cells,
process-like and thread-like concurrency mechanisms, and a novel
form of multi-versioned store. Our interpretation scheme is prac-
|
