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 in the Age of the Turing Machineby Thomas Hales - arXiv
Computers have rapidly become so pervasive in mathematics that future generations may look back to this day as a golden dawn. The article gives a survey of mathematical proofs that rely on computer calculations and formal proofs.
(18422 views)
Algorithmic Algebraby Bhubaneswar Mishra - Courant Institute of Mathematical Sciences
The main purpose of the book is to acquaint advanced undergraduate and graduate students in computer science, engineering and mathematics with the algorithmic ideas in computer algebra so that they could do research in computational algebra.
(24613 views)
A Computational Introduction to Number Theory and Algebraby Victor Shoup - Cambridge University Press
This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes. It is accessible to a broad audience. Prerequisites are a typical undergraduate course in calculus and some experience in doing proofs.
(43958 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.
(29572 views)