Skip to main content
European Commission logo print header

The Semantics and Pragmatics of Extended Term Graph Rewriting

Objetivo

The long-term objective of Semagraph partners is to develop a comprehensive practical theory for reasoning about the performance and functionality of IT systems which is based on term graphs as opposed to trees. A key short term aim of this working group is to consolidate and promulgate results from the Semagraph I (BRA 3074) project, both theoretical and practical.
Todays software developer is faced with a range of programming paradigms embedded in increasingly sophisticated user interface standards. One way of attacking this complexity is to develop a computational model which is intermediate between low machine level models, the models associated with particular programming paradigms, and the higher level interface models. Research has been carried out to explore the potential of a term graph rewriting model of computation. Of specific interest is the theory of orthogonal term rewrite systems and its relation to term graph rewriting. Topics studied include type systems for term graphs, modularity, notions of simulation, practical extensions of term graph rewriting, and control issues.

Major results were published in book form. The 2 books appeared in 1993. On the practical side, improved versions of the Concurrent CLEAN programming system continue to be released.
The group concentrates on extending the theory of orthogonal term graph rewriting, and relating it to experience obtained with the partners' prototype implementations. The following topics indicate the scope of the working group: foundations of term graph rewriting, appropriate notions of typing, modularity, and simulation for term graphs; the relationship between term graph rewriting and other notions of graph transformation; extensions of term graph rewriting to support control and limited notions of state, mapping of process calculi to extended term graph models, semantic-based transformation techniques for deriving control information automatically.

Two new promising areas of activity are:

- the beginnings of an equational theory of graph rewriting which can be applied to lambda graphs
- a theoretical basis for the compile time analysis of UNIQUE types performed by the Concurrent CLEAN compiler.

POTENTIAL

Future systems will increasingly be designed using several language paradigms. Extended term graph models of computation provide a good candidate of a common model of computation both for reasoning about functionality and performance of hybrid systems.

Tema(s)

Data not available

Convocatoria de propuestas

Data not available

Régimen de financiación

Data not available

Coordinador

University of East Anglia
Aportación de la UE
Sin datos
Dirección
University Plain
NR4 7TJ Norwich
Reino Unido

Ver en el mapa

Coste total
Sin datos

Participantes (5)