The following theses are available on this subject.
Stephen Jonhson, MS thesis, July 2004,Improving the Effciency of Non-Deterministic Computations in Curry
A visual debugger for non-deterministic, complete, functional logic computation
Jason Wilcox, BS Honor thesis, May 2004,
An efficient architecture and implementation for non-deterministic functional logic computations.
Toward a Feasible Functional Logic Compiler Employing Fair Search
Marius Nita, BS Honor thesis, June 2005,
An FLP compiler that employs fair search and a novel application of first-class stores in its implementation of narrowing.
The following three Master theses are available on this subject.
Evaluable Functions in the Goedel Programming Language:
Parsing and Representing Rewrite Rules,
Janet Vorvick, MS thesis, Oct. 1995,Compiling Evaluable Functions in the Goedel Programming Language
The thesis extends the Goedel syntax to accommodate user-defined evaluable functions and performs some semantic analysis.
David Shapiro, MS thesis, Feb. 1996Needed Narrowing as the Computational Strategy of Evaluable Functions in an Extension of Goedel
The thesis implements leftmost-innermost narrowing as the evaluation strategy for user-defined evaluable functions.
Bobbi Barry, MS thesis, June 1996
The thesis implements needed narrowing as the evaluation strategy for user-defined evaluable functions.