An Architecture For Combinator Graph Reduction

An Architecture for Combinator Graph Reduction

An Architecture for Combinator Graph Reduction examines existing methods of evaluating lazy functional programs using combinator reduction techniques, implementation, and characterization of a means for accomplishing graph reduction on uniprocessors, and analysis of the potential for special-purpose hardware implementations. Comprised of eight chapters, the book begins by providing a background on functional programming languages and existing implementation technology. Subsequent chapters discuss the TIGRE (Threaded Interpretive Graph Reduction Engine) methodology for implementing combinator graph reduction; the TIGRE abstract machine, which is used to implement the graph reduction methodology; the results of performance measurements of TIGRE on a variety of platforms; architectural metrics for TIGRE executing on the MIPS R2000 processor; and the potential for special-purpose hardware to yield further speed improvements. The final chapter summarizes the results of the research, and suggests areas for further investigation. Computer engineers, programmers, and computer scientists will find the book interesting.

An architecture for combinator graph reduction

Computer Programming to Insure Project Accountability in Africa

This is the first book of its kind to offer a series of computer programming models for the practical purpose of insuring project accountability in African countries. Despite its practicality, the book is also theoretically well-grounded. By doing so, it seeks to extend the epistemological boundaries of both Computer Science and Economics. It is, therefore, useful for students and teachers in those disciplines, and for policy-makers and practitioners in the field of economic development