Skip to main content
SpringerLink
Log in

Graph Reduction

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

  • Conference proceedings
  • © 1987

Overview

Editors:
  1. Joseph H. Fasel
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Robert M. Keller
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 279)

Included in the following conference series:

Conference proceedings info: GR 1986.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (23 papers)

  1. Parallel execution of an equational language

    • Bharat Jayaraman, Gopal Gupta
    Pages 370-381

  2. Implementing logical variables on a graph reduction architecture

    • Gary Lindstrom
    Pages 382-400

  3. Functional logic languages part I

    • Uday S. Reddy
    Pages 401-425

  4. Unification of quantified terms

    • John Staples, Peter J. Robinson
    Pages 426-450
Back to top

Other volumes

  1. Graph Reduction

Keywords

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation