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 using graphs rather than strings or trees is that common subexpressions can be shared, which improves the efficiency of computations in space and time. Sharing is ubiquitous in implementations of functional and logic programming languages, systems for automated reasoning, and symbolic computation systems.
Research in term graph rewriting ranges from theoretical questions to practical implementation issues. It includes such different lines as the modelling of (finite or infinitary) first-order term rewriting by (acyclic or cyclic) graph rewriting, interaction nets and sharing graphs for Levy-optimal reduction in the lambda calculus, rewrite calculi on cyclic higher-order term graphs for the semantics and analysis of functional programs, graph reduction implementations of functional programming languages, and automated reasoning and symbolic computation systems working on shared structures.
Invited Speaker: Stefano Guerrini (University of Roma "La Sapienza").
Programme: Click here.
Photo (by Pierre Lescanne).
Submissions and Publication
After the workshop authors are invited to submit a full paper of their presentation. Accepted contributions will appear in an issue of Elsevier's Electronic Notes in Theoretical Computer Science.
|Submission Deadline for ENTCS Proceedings (max 24 pages):||15 November, 2004|
|Notification:||15 December, 2004|
|Final Versions:||15 January, 2005|
|Maribel Fernández||King's College London (UK), chair|
|Fabio Gadducci||University of Pisa (Italy)|
|Detlef Plump||University of York (UK)|
|Femke van Raamsdonk||Free University of Amsterdam (NL)|
|Andrea Corradini||University of Pisa (Italy)|
Department of Computer Science
King's College London
Strand, London WC2R 2LS