Portland State University. Department of Computer Science
Date of Publication
Master of Science (M.S.) in Computer Science
Graph rewriting, Functional programming languages, Functional programming (Computer science), Logic programming, Rewriting systems (Computer science), Programming language implementation
1 online resource (viii, 64 p.) : ill. (some col.) + 1 compressed tar archive (tgz file)
Functional logic languages provide a powerful programming paradigm combining the features of functional languages and logic languages. However, current implementations of functional logic languages are complex, slow, or both. This thesis presents a scheme, called the Basic Scheme, for compiling and executing functional logic languages based on non-deterministic graph rewriting. This thesis also describes the implementation and optimization of a prototype of the Basic Scheme. The prototype is simple and performs well compared to other current implementations.
In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).
Peters, Arthur, "The Basic Scheme for the Evaluation of Functional Logic Programs" (2012). Dissertations and Theses. Paper 914.