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: Isabelle/HOL: A Proof Assistant for Higher-Order LogicIsabelle/HOL: A Proof Assistant for Higher-Order Logic
by - Springer
This book is a self-contained introduction to interactive proof in higher-order logic, using the proof assistant Isabelle. It is a tutorial for potential users. The book has three parts: Elementary Techniques; Logic and Sets; Advanced Material.
(14139 views)
Book cover: A Computational Introduction to Number Theory and AlgebraA Computational Introduction to Number Theory and Algebra
by - 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.
(38245 views)
Book cover: Vector Math for 3D Computer GraphicsVector Math for 3D Computer Graphics
by - 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.
(19297 views)
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.
(27526 views)