Advisor

Sergio Antoy

Date of Award

Spring 1-1-2012

Document Type

Thesis

Degree Name

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

Department

Computer Science

Physical Description

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

Subjects

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

DOI

10.15760/etd.914

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.

Description

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

ViaLOIS-20120427.tgz (61 kB)
Supplementary Data

Share

COinS