Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Publication
- Publication Type
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
A New Functional-Logic Compiler For Curry: Sprite, Sergio Antoy, Andy Jost
A New Functional-Logic Compiler For Curry: Sprite, Sergio Antoy, Andy Jost
Computer Science Faculty Publications and Presentations
We introduce a new native code compiler for Curry codenamed Sprite. Sprite is based on the Fair Scheme, a compilation strategy that provides instructions for transforming declarative, non-deterministic programs of a certain class into imperative, deterministic code. We outline salient features of Sprite, discuss its implementation of Curry programs, and present benchmarking results. Sprite is the first-to-date operationally complete implementation of Curry. Preliminary results show that ensuring this property does not incur a significant penalty.
The Basic Scheme For The Evaluation Of Functional Logic Programs, Arthur Peters
The Basic Scheme For The Evaluation Of Functional Logic Programs, Arthur Peters
Dissertations and Theses
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.
The Design And Implementation Of A Safe, Lightweight Haskell Compiler, Timothy Jan Chevalier
The Design And Implementation Of A Safe, Lightweight Haskell Compiler, Timothy Jan Chevalier
Computer Science Faculty Publications and Presentations
Typed programming languages offer safety guarantees that help programmers write correct code, but typical language implementations offer no proof that source-level guarantees extend to executable code. Moreover, typical implementations link programs with unsafe runtime system (RTS) code. I present a compiler for the functional language Haskell that preserves some of the properties of Haskell’s type system. The soundness proof for the combination of the compiler and a verified RTS requires a proof that the compiler emits code that cooperates correctly with the RTS. In particular, the latter proof must address the boundary between the user program and the garbage collector. …