Send Close Add comments: (status displays here)
Got it!  This site "robinsnyder.com" uses cookies. You consent to this by clicking on "Got it!" or by continuing to use this website.  Note: This appears on each machine/browser from which this site is accessed.
PhD dissertation overview
by RS  admin@robinsnyder.com : 1024 x 640


1. Dissertation title
Issues in the implementation of lazy functional languages

2. Abstract
Fixed set combinators provide an elegant, but inefficient, method of implementing lazy normal-order evaluation of functional languages. A generalized director-string combinator code is developed to provide an efficiently compiled and fully lazy pure code. This code form facilitates module hierarchies, dynamic debugging and parallel evaluation, being well suited to encoding heuristics and annotations for the implementation of fine grain parallelism, crucial in overcoming the inherent inefficiency of combinators. The debugging of lazy functional programs can be a nontrivial matter. A method is developed to facilitate the debugging of functional programs by allowing dynamic reconstruction of source-like expressions from run-time combinator code with small time and space cost.

3. Application
The meaning can be briefly explained as follows. My interest was primarily focused in developing meaningful high level notations that could be compiled to efficient low-level code implementations such that, with minimal machine overhead, a meaningful representation of the computation could be reverse engineered and manipulated for debugging and diagnostic purposes.

by RS  admin@robinsnyder.com : 1024 x 640