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
Algorithmic Mathematicsby Leonard Soicher, Franco Vivaldi - Queen Mary University of London
This text is a course in mathematical algorithms, intended for second year mathematics students. It introduces the algorithms for computing with integers, polynomials and vector spaces. The course requires no computing experience.
(27029 views)
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.
(29957 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.
(22933 views)
Fractals- Wikibooks
The aim of this text is to develop an informal, light introduction to the world of fractal geometry and to inspire further research into the subject, whether your interest is of a pure, applied or even recreational nature.
(11835 views)