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
Mathematics for Computer Scientistsby Gareth J. Janacek, Mark L. Close - BookBoon
In this textbook you will find the basic mathematics needed by computer scientists. It should help you to understand the meaning of mathematical concepts. Subjects as elementary logic, factorization, plotting functions and matrices are explained.
(28712 views)
The Life of Pi: From Archimedes to Eniac and Beyondby Jonathan M. Borwein - DocServer
The desire to understand Pi, the challenge, and originally the need, to calculate ever more accurate values of Pi, has challenged mathematicians for many many centuries, and Pi has provided compelling examples of computational mathematics.
(21617 views)
Vector Math for 3D Computer Graphicsby Bradley Kjell - Central Connecticut State University
A text on vector and matrix algebra from the viewpoint of computer graphics. It covers most vector and matrix topics needed for college-level computer graphics text books. Useful to computer science students interested in game programming.
(23877 views)
Probabilistic Programming and Bayesian Methods for Hackersby Cameron Davidson-Pilon - GitHub, Inc.
This book is designed as an introduction to Bayesian inference from a computational understanding-first, and mathematics-second, point of view. The book assumes no prior knowledge of Bayesian inference nor probabilistic programming.
(24181 views)