Hostname: page-component-76fb5796d-x4r87 Total loading time: 0 Render date: 2024-04-27T04:59:42.510Z Has data issue: false hasContentIssue false
  • English
  • Français

Theory and applications of term graph rewriting: introduction

Published online by Cambridge University Press:  01 June 2007

IAN MACKIE  and
DETLEF PLUMP
IAN MACKIE
Affiliation:
King's College London, Department of Computer Science, Strand, London WC2R 2LS, U.K. and LIX, École Polytechnique, 91128 Palaiseau Cedex, France
DETLEF PLUMP
Affiliation:
Department of Computer Science, The University of York, Heslington, York YO10 5DD, U.K.
Get access Rights & Permissions [Opens in a new window]

Extract

Term graph rewriting is concerned with the representation of functional expressions as graphs and the evaluation of these expressions by rule-based graph transformation. The advantage of computing with graphs rather than terms is that common subexpressions can be shared, improving the efficiency of computations in space and time. Sharing is ubiquitous in implementations of programming languages: many functional, logic, object-oriented and concurrent calculi are implemented using term graphs.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 17 , Issue 3 , June 2007 , pp. 361 - 362
Copyright
Copyright © Cambridge University Press 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)