First Advisor

Sergio Antoy

Date of Publication

Spring 1-1-2012

Document Type

Thesis

Degree Name

Master of Science (M.S.) in Computer Science

Department

Computer Science

Language

English

Subjects

Graph rewriting, Functional programming languages, Functional programming (Computer science), Logic programming, Rewriting systems (Computer science), Programming language implementation

DOI

10.15760/etd.914

Physical Description

1 online resource (viii, 64 p.) : ill. (some col.) + 1 compressed tar archive (tgz file)

Abstract

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.

Rights

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).

Comments

Supplemental file of a Basic Scheme programming language prototype requires WinZip or 7-Zip software for viewing. Portland State University. Department of Computer Science

Persistent Identifier

http://archives.pdx.edu/ds/psu/8296

Additional Files
ViaLOIS-20120427.tgz (61 kB)
Supplementary Data
Download

Share

COinS