Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Making Curry With Rice: An Optimizing Curry Compiler, Steven Libby
Making Curry With Rice: An Optimizing Curry Compiler, Steven Libby
Dissertations and Theses
In this dissertation we present the RICE optimizing compiler for the functional logic language Curry. This is the first general optimizing compiler for a functional logic language. Our work is based on the idea of compiling through program transformations, which we have adapted from the functional language compiler community. We also present the GAS system for generating new program transformations, which uses the power of functional logic programming to provide a flexible framework for describing transformations. This allows us to describe and implement a wide range of optimizations including inlining, shortcut deforestation, unboxing, and case shortcutting, a new optimization we …
Fenchel-Rockafellar Theorem In Infinite Dimensions Via Generalized Relative Interiors, Dang Van Cuong, Mau Nam Nguyen, B. S. Mordukhovich, G. Sandine
Fenchel-Rockafellar Theorem In Infinite Dimensions Via Generalized Relative Interiors, Dang Van Cuong, Mau Nam Nguyen, B. S. Mordukhovich, G. Sandine
Mathematics and Statistics Faculty Publications and Presentations
In this paper we provide further studies of the Fenchel duality theory in the general framework of locally convex topological vector (LCTV) spaces. We prove the validity of the Fenchel strong duality under some qualification conditions via generalized relative interiors imposed on the epigraphs and the domains of the functions involved. Our results directly generalize the classical Fenchel-Rockafellar theorem on strong duality from finite dimensions to LCTV spaces.
Using Intrinsically-Typed Definitional Interpreters To Verify Compiler Optimizations In A Monadic Intermediate Language, Dani Barrack
Using Intrinsically-Typed Definitional Interpreters To Verify Compiler Optimizations In A Monadic Intermediate Language, Dani Barrack
Dissertations and Theses
Compiler optimizations are critical to the efficiency of modern functional programs. At the same time, optimizations that unintentionally change the semantics of programs can systematically introduce errors into programs that pass through them. The question of how to best verify that optimizations and other program transformations preserve semantics is an important one, given the potential for error introduction. Dependent types allow us to prove that properties about our programs are correct, as well as to design data types and interpreters in such a way that they are correct-by-construction. In this thesis, we explore the use of dependent types and intrinsically-typed …