An Architecture for Combinator Graph Reduction
An Architecture for Combinator Graph Reduction

Author: Philip John Koopman

Publisher: Elsevier

Published: 2014-05-12

Total Pages: 172

ISBN-13: 1483270467

DOWNLOAD EBOOK

An Architecture for Combinator Graph Reduction examines existing methods of evaluating lazy functional programs using combinator reduction techniques, implementation, and characterization of a means for accomplishing graph reduction on uniprocessors, and analysis of the potential for special-purpose hardware implementations. Comprised of eight chapters, the book begins by providing a background on functional programming languages and existing implementation technology. Subsequent chapters discuss the TIGRE (Threaded Interpretive Graph Reduction Engine) methodology for implementing combinator graph reduction; the TIGRE abstract machine, which is used to implement the graph reduction methodology; the results of performance measurements of TIGRE on a variety of platforms; architectural metrics for TIGRE executing on the MIPS R2000 processor; and the potential for special-purpose hardware to yield further speed improvements. The final chapter summarizes the results of the research, and suggests areas for further investigation. Computer engineers, programmers, and computer scientists will find the book interesting.

Handbook of Logic in Artificial Intelligence and Logic Programming: Volume 5: Logic Programming
Handbook of Logic in Artificial Intelligence and Logic Programming: Volume 5: Logic Programming

Author: Dov M. Gabbay

Publisher: Clarendon Press

Published: 1998-01-08

Total Pages: 818

ISBN-13: 0191546283

DOWNLOAD EBOOK

The Handbook of Logic in Artificial Intelligence and Logic Programming is a multi-volume work covering all major areas of the application of logic to artificial intelligence and logic programming. The authors are chosen on an international basis and are leaders in the fields covered. Volume 5 is the last in this well-regarded series. Logic is now widely recognized as one of the foundational disciplines of computing. It has found applications in virtually all aspects of the subject, from software and hardware engineering to programming languages and artificial intelligence. In response to the growing need for an in-depth survey of these applications the Handbook of Logic in Artificial Intelligence and its companion, the Handbook of Logic in Computer Science have been created. The Handbooks are a combination of authoritative exposition, comprehensive survey, and fundamental research exploring the underlying themes in the various areas. Some mathematical background is assumed, and much of the material will be of interest to logicians and mathematicians. Volume 5 focuses particularly on logic programming. The chapters, which in many cases are of monograph length and scope, emphasize possible unifying themes.

Functional Programming, Glasgow 1991
Functional Programming, Glasgow 1991

Author: Rogardt Heldal

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 374

ISBN-13: 1447131967

DOWNLOAD EBOOK

The Glasgow functional programming group has held a workshop each summer since 1988. The entire group, accompanied by a selection of colleagues from other institutions, retreats to a pleasant Scottish location for a few days. Everyone speaks briefly, enhancing coherence, cross fertilisation, and camaraderie in our work. The proceedings of the first workshop were published as a technical report. Demand for this was large enough to encourage wider publication, and subsequent proceedings have been published in the Springer-Verlag Workshops in Computing series. These are the proceedings of the-meeting held 12-14 August 1991, in Portree on the Isle of Skye. A preliminary proceedings was prepared in advance of the meeting. Most presentations were limited to a brief fifteen minutes, outlining the essentials of their subject, and referring the audience to the pre-print proceedings for details. Papers were then refereed and rewritten, and you hold the final results in your hands. A number of themes emerged at this year's workshop, including relational algebra and its application to hardware design, partial evaluation and program transformation, implementation techniques, and strictness analysis. We were especially pleased to see applications of functional programming emerge as a theme. One of the sessions was devoted to a lively discussion of applications, and was greatly enhanced by our industrial participants. The workshop was organised by Kei Davis, Cordelia Hall, Rogardt Heldal, Carsten Kehler Holst, John Hughes, John O'Donnell, and Satnam Singh all from the University of Glasgow.

Graph Reduction
Graph Reduction

Author: Joseph H. Fasel

Publisher: Springer Science & Business Media

Published: 1987-10-07

Total Pages: 58

ISBN-13: 9783540184201

DOWNLOAD EBOOK

This volume describes recent research in graph reduction and related areas of functional and logic programming, as reported at a workshop in 1986. The papers are based on the presentations, and because the final versions were prepared after the workshop, they reflect some of the discussions as well. Some benefits of graph reduction can be found in these papers: - A mathematically elegant denotational semantics - Lazy evaluation, which avoids recomputation and makes programming with infinite data structures (such as streams) possible - A natural tasking model for fine-to-medium grain parallelism. The major topics covered are computational models for graph reduction, implementation of graph reduction on conventional architectures, specialized graph reduction architectures, resource control issues such as control of reduction order and garbage collection, performance modelling and simulation, treatment of arrays, and the relationship of graph reduction to logic programming.

Proceedings of the 1995 International Conference on Parallel Processing
Proceedings of the 1995 International Conference on Parallel Processing

Author: Prithviraj Banerjee

Publisher: CRC Press

Published: 1995-08-08

Total Pages: 260

ISBN-13: 9780849326158

DOWNLOAD EBOOK

This set of technical books contains all the information presented at the 1995 International Conference on Parallel Processing. This conference, held August 14 - 18, featured over 100 lectures from more than 300 contributors, and included three panel sessions and three keynote addresses. The international authorship includes experts from around the globe, from Texas to Tokyo, from Leiden to London. Compiled by faculty at the University of Illinois and sponsored by Penn State University, these Proceedings are a comprehensive look at all that's new in the field of parallel processing.

Head-Order Techniques and Other Pragmatics of Lambda Calculus Graph Reduction
Head-Order Techniques and Other Pragmatics of Lambda Calculus Graph Reduction

Author: Nikos B. Troullinos

Publisher: Universal-Publishers

Published: 2011-10

Total Pages: 250

ISBN-13: 1612337570

DOWNLOAD EBOOK

Available in Paperback Available in eBook editions (PDF format) Institution: Syracuse University (Syracuse, NY, USA) Advisor(s): Prof. Klaus J. Berkling Degree: Ph.D. in Computer and Information Science Year: 1993 Book Information: 248 pages Publisher: Dissertation.com ISBN-10: 1612337570 ISBN-13: 9781612337579 View First 25 pages: (free download) Abstract The operational aspects of Lambda Calculus are studied as a fundamental basis for high-order functional computation. We consider systems having full reduction semantics, i.e., equivalence-preserving transformations of functions. The historic lineage from Eval-Apply to SECD to RTNF/RTLF culminates in the techniques of normal-order graph Head Order Reduction (HOR). By using a scalar mechanism to artificially bind relatively free variables, HOR makes it relatively effortless to reduce expressions beyond weak normal form and to allow expression-level results while exhibiting a well-behaved linear self-modifying code structure. Several variations of HOR are presented and compared to other efficient reducers, with and without sharing, including a conservative breadth-first one which mechanically takes advantage of the inherent, fine-grained parallelism of the head normal form. We include abstract machine and concrete implementations of all the reducers in pure functional code. Benchmarking comparisons are made through a combined time-space efficiency metric. The original results indicate that circa 2010 reduction rates of 10-100 million reductions per second can be achieved in software interpreters and a billion reductions per second can be achieved by a state-of-the art custom VLSI implementation.

Computer Programming to Insure Project Accountability in Africa
Computer Programming to Insure Project Accountability in Africa

Author: Abdul Karim Bangura

Publisher: iUniverse

Published: 2001

Total Pages: 262

ISBN-13: 059519642X

DOWNLOAD EBOOK

This is the first book of its kind to offer a series of computer programming models for the practical purpose of insuring project accountability in African countries. Despite its practicality, the book is also theoretically well-grounded. By doing so, it seeks to extend the epistemological boundaries of both Computer Science and Economics. It is, therefore, useful for students and teachers in those disciplines, and for policy-makers and practitioners in the field of economic development