International Workshop on Term Graph Rewriting
7 October 2002
A satellite event of
The First International Conference on Graph Transformation
Background and Aims
Term graph rewriting is concerned with the representation of functional expressions as graphs and the evaluation of these expressions by rule-based graph transformation. Using graphs rather than strings or trees allows to share common subexpressions, 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, rewrite rules on so-called 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.
The aim of this workshop is to bring together researchers working in these different domains and to foster their interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in term graph rewriting. TERMGRAPH 2002 will be a one-day satellite event of the International Conference on Graph Transformation (ICGT 2002), which will take place October 7-12, 2002, in Barcelona.
Topics of Interest
Topics of interest include all aspects of term graphs and sharing of common subexpressions in rewriting, programming, automated reasoning and symbolic computation. This includes (but is not limited to):
Authors are invited to submit an extended abstract of 5 to 10 pages by e-mail to the program chair (firstname.lastname@example.org). Submissions should be in PostScript format. It is strongly recommended to use LaTeX and ENTCS style files.
Accepted contributions will appear in an issue of Elsevier's Electronic Notes in Theoretical Computer Science. Preliminary proceedings will be available at the workshop.
|Submission deadline:||June 20, 2002|
|Notification:||July 15, 2002|
|Final version due:||September 6, 2002|
|Workshop:||October 7, 2002|
|ICGT 2002:||October 8-11, 2002|
|Zena M. Ariola||University of Oregon, Eugene (US)|
|Richard Banach||University of Manchester (UK)|
|Rachid Echahed||IMAG, Grenoble (FR)|
|Richard Kennaway||University of East Anglia, Norwich (UK)|
|Jan Willem Klop||Free University of Amsterdam (NL)|
|Rinus Plasmeijer||University of Nijmegen (NL)|
|Detlef Plump||University of York (UK), chair|
Dr. Detlef Plump
Department of Computer Science
The University of York
Heslington, York YO10 5DD
Phone: +44 1904 434778
Fax: +44 1904 432767
Home page: http://www.cs.york.ac.uk/~det