Open Access. Powered by Scholars. Published by Universities.®
Programming Languages and Compilers Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Programming Languages and Compilers
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 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. …