Electronic Notes in Theoretical Computer Science, Volume 2

Volume 2, 1995

• Andrea Corradini, Ugo Montanari:
  Preface.
  
• Richard Banach:
  DPO rewriting and abstract semantics via opfibrations.
  
• Erik Barendsen, Sjaak Smetsers:
  A derivation system for uniqueness typing.
  
• Michel Bauderon:
  Parallel rewriting of graphs through the pullback approach.
  
• Eike Best, Maciej Koutny:
  Using net refinement to compute the fixpoint of a recursive.
  
• Simon Brock, Gerald Ostheimer:
  A process semantics for functional programming.
  
• David Clark, Richard Kennaway:
  Some properties of non-orthogonal term graph rewriting systems.
  
• Andrea Corradini, Reiko Heckel:
  A compositional approach to structuring and refinement of typed graph grammars.
  
• Andrea Corradini:
  Concurrent computing: from Petri nets to graph grammars.
  
• Bruno Courcelle:
  Logic and graphs.
  
• Anke Drappa, Ralf Melchisedech:
  The use of graph grammar in a software engineering education tool.
  
• Frank Drewes:
  Semirings and tree-to-graph-to-tree transductions.
  
• Hartmut Ehrig:
  Introduction to COMPUGRAPH.
  
• Gregor Engels, Andy Schürr:
  Encapsulated hierarchical graphs, graph types, and meta types.
  
• Annegret Habel, Detlef Plump:
  Unification, rewriting, and narrowing on term graphs.
  
• Reiko Heckel, Annika Wagner:
  Ensuring consistency of conditional graph rewriting - a constructive approach.
  
• Peter Heimann, Gregor Joeris, Carl-Arndt Krapp, Bernhard Westfechtel:
  A programmed graph rewriting system for software process management.
  
• Dirk Janssens:
  Process languages for ESM systems.
  
• Thomas Johnsson:
  Graph reduction, and how to avoid it.
  
• Richard Kennaway:
  Infinitary rewriting and cyclic graphs.
  
• Zurab Khasidashvili, Vincent van Oostrom:
  Context-sensitive conditional expression reduction systems.
  
• Martin Korff, Leila Ribeiro:
  Concurrent derivations as single pushout graph grammar processes.
  
• Hans-Jörg Kreowski:
  Specification and programming (by graph transformation).
  
• Sabine Kuske:
  Implementing beta-reduction by hypergraph rewriting.
  
• Igor Litovsky, Yves Métivier, Eric Sopena:
  Checking global graph properties by means of local computations: the majority problem.
  
• Miquel Monserrat, Francesc Rosselló, Joan Torrens, Gabriel Valiente:
  Hypergraph rewriting using conformisms.
  
• Marinus J. Plasmeijer:
  CLEAN: a programming environment based on term graph rewriting.
  
• Yves-Marie Quemener, Thierry Jéron:
  Model-checking of infinite Kripke structures defined by simple graph grammars.
  
• Georg Schied, Klaus Barthelmann:
  Linear types for higher order processes with first class directed channels.
  
• Hans Jürgen Schneider:
  A note on outward and inward productions in the categorical graph-grammar approach and Delta-grammars.
  
• Detlef Seese:
  Linear time computable problems and logical descriptions.
  
• Duncan Shand, Simon Brock:
  Proofs as graphs.
  
• M. Ronan Sleep:
  SEMAGRAPH: the theory and practice of term graph rewriting.
  
• Gabriele Taentzer, Andy Schürr:
  DIEGO, another step towards a module concept for graph transformation systems.
  
• Chris Wadsworth:
  Graph reduction: a retrospective.