Lecture Notes in Computer Science
cover

Graph Reduction

Proceedings of a Workshop Santa Fe, New Mexico, USA, September 29 - October 1, 1986

Editors: Fasel, Joseph H., Keller, Robert M. (Eds.)

Buy this book

eBook $99.00
price for USA in USD (gross)
  • The eBook version of this title will be available soon
  • ISBN 978-3-540-47963-5
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $129.00
price for USA in USD
  • ISBN 978-3-540-18420-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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.

Table of contents (23 chapters)

Table of contents (23 chapters)
  • On the correspondence of lambda style reduction and combinator style reduction

    Oberhauser, Hans-Georg

    Pages 1-25

  • Head order reduction: A graph reduction scheme for the operational lambda calculus

    Berkling, Klaus

    Pages 26-48

  • A simple abstract machine to execute supercombinators

    Fairbairn, Jon

    Pages 49-52

  • Concurrent term rewriting as a model of computation

    Goguen, Joseph (et al.)

    Pages 53-93

  • Alfalfa: Distributed graph reduction on a hypercube multiprocessor

    Goldberg, Benjamin (et al.)

    Pages 94-113

Buy this book

eBook $99.00
price for USA in USD (gross)
  • The eBook version of this title will be available soon
  • ISBN 978-3-540-47963-5
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $129.00
price for USA in USD
  • ISBN 978-3-540-18420-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Graph Reduction
Book Subtitle
Proceedings of a Workshop Santa Fe, New Mexico, USA, September 29 - October 1, 1986
Editors
  • Joseph H. Fasel
  • Robert M. Keller
Series Title
Lecture Notes in Computer Science
Series Volume
279
Copyright
1987
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-47963-5
DOI
10.1007/3-540-18420-1
Softcover ISBN
978-3-540-18420-1
Series ISSN
0302-9743
Edition Number
1
Number of Pages
XVI, 450
Topics