An Architecture for Combinator Graph Reduction
by Philip J. Koopman, Jr.
Publisher: Academic Press 1990
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.
Download or read it online for free here:
Download link
(multiple PDF files)
Similar books
Algorithms in Real Algebraic Geometryby S. Basu, R. Pollack, M. Roy - Springer
The monograph gives a detailed exposition of the algorithmic real algebraic geometry. It is well written and will be useful both for beginners and for advanced readers, who work in real algebraic geometry or apply its methods in other fields.
(21128 views)
Mathematics for Algorithm and Systems Analysisby Edward A. Bender, S. Gill Williamson - 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.
(34816 views)
Mathematical Illustrations: A Manual of Geometry and PostScriptby Bill Casselman - Cambridge University Press
The author gives an introduction to basic features of the PostScript language and shows how to use it for producing mathematical graphics. The book includes the discussion computer graphics and some comments on good style in mathematical illustration.
(24197 views)
Think Stats: Probability and Statistics for Programmersby Allen B. Downey - Green Tea Press
Think Stats is an introduction to Probability and Statistics for Python programmers. This new book emphasizes simple techniques you can use to explore real data sets and answer interesting statistical questions. Basic skills in Python are assumed.
(27044 views)