An Architecture for Combinator Graph Reduction (TIGRE)
Overview & Synopsis
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.
Indexed from repository: FreeComputerBooks.com
(
freecomputerbooks.com)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | An Architecture for Combinator Graph Reduction (TIGRE) |
|---|---|
| Author / Organization | Philip J. Koopman, Jr. |
| Subject & Discipline | Graph Theory, Combinatorics and Game Theory, Discrete and Finite Mathematics, Operations Research (OR), Linear Programming, Optimization, and Approximation |
| Categories | Graph Theory |
| Publication Year | 1990 |
| ISBN | 978-0124192409 |
| Resource Verification | Verification pending |
| Original Host Website |
FreeComputerBooks.com
(freecomputerbooks.com)
|
| File Format | application/pdf (Portable Document Format) |
| Language | ENGLISH |
| Catalog ID | DOC-104637 |
| Original Source Link | Visit Source Page on freecomputerbooks.com » |
Commercial / Print Edition
Prefer a Physical Book or Kindle Edition?
An Architecture for Combinator Graph Reduction (TIGRE) • Print Edition
As an Amazon Associate, MainReads earns from qualifying purchases.