Logo

An Architecture for Combinator Graph Reduction

Large book cover: An Architecture for Combinator Graph Reduction

An Architecture for Combinator Graph Reduction
by

Publisher: Academic Press
ISBN/ASIN: 0124192408
ISBN-13: 9780124192409
Number of pages: 176

Description:
The results of cache-simulation experiments with an abstract machine for reducing combinator graphs are presented. The abstract machine, called TIGRE, exhibits reduction rates that, for similar kinds of combinator graphs on similar kinds of hardware, compare favorably with previously reported techniques.

Home page url

Download or read it online for free here:
Download link
(multiple PDF files)

Similar books

Book cover: Mathematics for Algorithm and Systems AnalysisMathematics for Algorithm and Systems Analysis
by - Dover Publications
This text assists undergraduates in mastering the mathematical language to address problems in the field's many applications. It consists of 4 units: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.
(31524 views)
Book cover: Curves and Surfaces in Geometric Modeling: Theory and AlgorithmsCurves and Surfaces in Geometric Modeling: Theory and Algorithms
by - Morgan Kaufmann
This book offers both a theoretically unifying understanding of polynomial curves and surfaces and an effective approach to implementation that you can bring to bear on your own work -- whether you are a graduate student, scientist, or practitioner.
(7663 views)
Book cover: Numerical Algorithms: Methods for Computer Vision, Machine Learning, and GraphicsNumerical Algorithms: Methods for Computer Vision, Machine Learning, and Graphics
by - CRC Press
Using examples from a broad base of computational tasks, including data processing and computational photography, the book introduces numerical modeling and algorithmic design from a practical standpoint and provides insight into theoretical tools.
(9940 views)
Book cover: Art Gallery Theorems and AlgorithmsArt Gallery Theorems and Algorithms
by - Oxford University Press
Art gallery theorems and algorithms are so called because they relate to problems involving the visibility of geometrical shapes and their internal surfaces. This book explores generalizations and specializations in these areas.
(20765 views)