default search action
SEGRAGRA 1995: Volterra, Italy
- Andrea Corradini, Ugo Montanari:
Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation, SEGRAGRA 1995, Volterra, Italy, August 28 - September 1, 1995. Electronic Notes in Theoretical Computer Science 2, Elsevier 1995 - Andrea Corradini
, Ugo Montanari:
Preface. 1-2 - Richard Banach:
DPO rewriting and abstract semantics via opfibrations. 3-10 - Erik Barendsen, Sjaak Smetsers:
A derivation system for uniqueness typing. 11-18 - Michel Bauderon:
Parallel rewriting of graphs through the pullback approach. 19-26 - Eike Best, Maciej Koutny:
Using net refinement to compute the fixpoint of a recursive. 27-28 - Simon Brock, Gerald Ostheimer:
A process semantics for functional programming. 29-35 - David Clark
Some properties of non-orthogonal term graph rewriting systems. 36-45 - Andrea Corradini
A compositional approach to structuring and refinement of typed graph grammars. 46-55 - Andrea Corradini
Concurrent computing: from Petri nets to graph grammars. 56-70 - Bruno Courcelle:
Logic and graphs. 71-72 - Anke Drappa, Ralf Melchisedech:
The use of graph grammar in a software engineering education tool. 73-80 - Frank Drewes:
Semirings and tree-to-graph-to-tree transductions. 81-88 - Hartmut Ehrig:
Introduction to COMPUGRAPH. 89-100 - Gregor Engels, Andy Schürr:
Encapsulated hierarchical graphs, graph types, and meta types. 101-109 - Annegret Habel, Detlef Plump:
Unification, rewriting, and narrowing on term graphs. 110-117 - Reiko Heckel, Annika Wagner:
Ensuring consistency of conditional graph rewriting - a constructive approach. 118-126 - Peter Heimann, Gregor Joeris, Carl-Arndt Krapp, Bernhard Westfechtel:
A programmed graph rewriting system for software process management. 127-136 - Dirk Janssens:
Process languages for ESM systems. 137-138 - Thomas Johnsson:
Graph reduction, and how to avoid it. 139-152 - Richard Kennaway:
Infinitary rewriting and cyclic graphs. 153-166 - Zurab Khasidashvili, Vincent van Oostrom
Context-sensitive conditional expression reduction systems. 167-176 - Martin Korff, Leila Ribeiro:
Concurrent derivations as single pushout graph grammar processes. 177-186 - Hans-Jörg Kreowski:
Specification and programming (by graph transformation). 187-190 - Sabine Kuske:
Implementing beta-reduction by hypergraph rewriting. 191-198 - Igor Litovsky, Yves Métivier, Éric Sopena:
Checking global graph properties by means of local computations: the majority problem. 199-206 - Miquel Monserrat, Francesc Rosselló
Hypergraph rewriting using conformisms. 207-214 - Marinus J. Plasmeijer:
CLEAN: a programming environment based on term graph rewriting. 215-221 - Yves-Marie Quemener, Thierry Jéron
Model-checking of infinite Kripke structures defined by simple graph grammars. 222-229 - Georg Schied, Klaus Barthelmann:
Linear types for higher order processes with first class directed channels. 230-237 - Hans Jürgen Schneider:
A note on outward and inward productions in the categorical graph-grammar approach and Delta-grammars. 238-245 - Detlef Seese:
Linear time computable problems and logical descriptions. 246-259 - Duncan Shand, Simon Brock:
Proofs as graphs. 260-267 - M. Ronan Sleep:
SEMAGRAPH: the theory and practice of term graph rewriting. 268-276 - Gabriele Taentzer, Andy Schürr:
DIEGO, another step towards a module concept for graph transformation systems. 277-285 - Chris Wadsworth:
Graph reduction: a retrospective. 286
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-03 23:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: