Digital Library
Close Browse articles from a journal
 
Search for with title:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             35 results found
no title author magazine year volume issue page(s) type
1 A Compositional Approach to Structuring and Refinement of Typed Graph Grammars Corradini, Andrea
 1995
 2 C p. 46-55
10 p.
 article
2 A Derivation System for Uniqueness Typing Barendsen, Erik
 1995
 2 C p. 11-18
8 p.
 article
3 A Note on Outward and Inward Productions in the Categorical Graph-Grammar Approach and Δ-Grammars Schneider, H.J.
 1995
 2 C p. 238-245
8 p.
 article
4 A Process Semantics for Functional Programming Brock, Simon
 1995
 2 C p. 29-35
7 p.
 article
5 A Programmed Graph Rewriting System for Software Process Management Heimann, Peter
 1995
 2 C p. 127-136
10 p.
 article
6 Checking Global Graph Properties by Means of Local Computations: the Majority Problem Litovsky, Igor
 1995
 2 C p. 199-206
8 p.
 article
7 Clean: a Programming Environment Based on Term Graph Rewriting Plasmeijer, M.J.
 1995
 2 C p. 215-221
7 p.
 article
8 Concurrent Computing: from Petri Nets to Graph Grammars Corradini, Andrea
 1995
 2 C p. 56-70
15 p.
 article
9 Concurrent Derivations as Single Pushout Graph Grammar Processes Korff, Martin
 1995
 2 C p. 177-186
10 p.
 article
10 Context-sensitive Conditional Expression Reduction Systems Khasidashvili, Zurab
 1995
 2 C p. 167-176
10 p.
 article
11 DIEGO, Another Step Towards a Module Concept for Graph Transformation Systems Taentzer, Gabriele
 1995
 2 C p. 277-285
9 p.
 article
12 DPO Rewriting and Abstract Semantics via Opfibrations Banach, R.
 1995
 2 C p. 3-10
8 p.
 article
13 Encapsulated Hierarchical Graphs, Graph Types, and Meta Types Engels, Gregor
 1995
 2 C p. 101-109
9 p.
 article
14 Ensuring Consistency of Conditional Graph Grammars - A Constructive Approach - Heckel, Reiko
 1995
 2 C p. 118-126
9 p.
 article
15 Graph Reduction, and How To Avoid It Johnsson, Thomas
 1995
 2 C p. 139-152
14 p.
 article
16 Graph Reduction: a Retrospective Wadsworth, Chris
 1995
 2 C p. 286-
1 p.
 article
17 Hypergraph Rewriting Using Conformisms Monserrat, M.
 1995
 2 C p. 207-214
8 p.
 article
18 Implementing β-Reduction by Hypergraph Rewriting Kuske, Sabine
 1995
 2 C p. 191-198
8 p.
 article
19 Infinitary Rewriting and Cyclic Graphs Kennaway, Richard
 1995
 2 C p. 153-166
14 p.
 article
20 Introduction to COMPUGRAPH Ehrig, Hartmut
 1995
 2 C p. 89-100
12 p.
 article
21 Linear Time Computable Problems and Logical Descriptions Seese, Detlef
 1995
 2 C p. 246-259
14 p.
 article
22 Linear Types for Higher Order Processes with First Class Directed Channels Schied, Georg
 1995
 2 C p. 230-237
8 p.
 article
23 Logic and Graphs Courcelle, Bruno
 1995
 2 C p. 71-72
2 p.
 article
24 Model-Checking of Infinite Kripke Structures Defined by Simple Graph Grammars Quemener, Yves-Marie
 1995
 2 C p. 222-229
8 p.
 article
25 Parallel Rewriting of Graphs through the Pullback Approach Bauderon, Michel
 1995
 2 C p. 19-26
8 p.
 article
26 Preface Corradini Ugo, Montanari, Andrea
 1995
 2 C p. 1-2
2 p.
 article
27 Process Languages for ESM Systems Janssens, D.
 1995
 2 C p. 137-138
2 p.
 article
28 Proofs as Graphs Shand, Duncan
 1995
 2 C p. 260-267
8 p.
 article
29 Semagraph: the Theory and Practice of Term Graph Rewriting Sleep, Ronan
 1995
 2 C p. 268-276
9 p.
 article
30 Semirings and Tree-to-Graph-to-Tree Transductions Drewes, Frank
 1995
 2 C p. 81-88
8 p.
 article
31 Some Properties of Non-Orthogonal Term Graph Rewriting Clark, David
 1995
 2 C p. 36-45
10 p.
 article
32 Specification and Programming (by Graph Transformation) Kreowski, Hans-Jörg
 1995
 2 C p. 187-190
4 p.
 article
33 The Use of Graph Grammar in a Software Engineering Education Tool Drappa, Anke
 1995
 2 C p. 73-80
8 p.
 article
34 Unification, Rewriting, and Narrowing on Term Graphs Habel, Annegret
 1995
 2 C p. 110-117
8 p.
 article
35 Using Net Refinement to Compute the Fixpoint of a Recursive Expression Best, Eike
 1995
 2 C p. 27-28
2 p.
 article
                             35 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands