Charles Stewart  Home/Search
Context
Related
| cs.tuberlin.de/cs/ifb/A...TR2002_01.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.tuberlin.de...hnBerichteListe (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A uniform framework of port graph grammars, encompassing connection graphs, interaction nets and Lamping's partial sharing graphs, has been presented by the author in the article `Reducibility between classes of port graph grammar'. The aims of this report are to 1. Give a complete proof of reducibility between general PGGs and simple PGGs (only an outline of the proof was given in that article); 2. Give a short summary of the design of an implementation executing rewrite steps for... (Update)
Similar documents (at the sentence level):
58.0%: Reducibility Between Classes of Port Graph Grammar - Stewart (2001) (Correct)
Active bibliography (related documents): More All
0.4: Sharing Continuations: Proofnets for Languages with Explicit.. - Lawall, Mairson (2000) (Correct)
0.2: Implementing Distributed Systems Using Linear Naming - Bawden (1993) (Correct)
0.2: Attributed Context-Free Hypergraph Grammars - Maneth, Vogler (1998) (Correct)
Similar documents based on text: More All
0.2: Emptiness problems of eNCE graph languages - K. Skodinis, E. Wanke (1995) (Correct)
0.2: Concept Formation Using Graph Grammars - Istvan Jonyer Lawrence (2002) (Correct)
0.2: Exponential time analysis of confluent and boundary eNCE.. - Skodinis, Wanke (1995) (Correct)
BibTeX entry: (Update)
@misc{ stewart-proof,
author = "Charles Stewart",
title = "A Proof of the Reducibility of General Port Graph Grammars to Simple Port
Graph Grammars",
url = "citeseer.ist.psu.edu/stewart02proof.html" }
Citations (may not include all citations):866 Techniques and Tools (context) - Aho, Sethi et al. - 1986
521 Compiling with Continuations (context) - Appel - 1992
447 Prentice Hall International (context) - Milner, Concurrency - 1989
286 The Connection Machine (context) - Hillis - 1985
254 Revised Report on the Algorithmic Language Scheme - Clinger, Rees - 1991
197 Barbed bisimulation - Milner, Sangiorgi - 1992
109 Interaction nets (context) - Lafont - 1990
75 The geometry of optimal lambda reduction - Gonthier, Abadi et al. - 1992
42 Linear logic without boxes - Gonthier, Abadi et al. - 1992
24 An algorithm for optimal lambda calculus reduction (context) - Lamping - 1990
23 The Optimal Implementation of Functional Programming Languag.. (context) - Asperti, Guerrini - 1998
16 A correspondence between Continuation Passing Style and Stat.. - Kelsey - 1995
16 Connection Graphs (context) - Bawden - 1986
15 Optimal reductions in the lambda-calculus (context) - Levy - 1980
9 Utilizing constraint satisfaction techniques for efficient g.. - Rudolf - 1998
8 Lambda: the ultimate declarative (context) - Steele - 1976
5 Programmed graph replacement systems (context) - urr - 1997
3 Implementing Distributed Systems Using Linear Naming - Bawden - 1993
2 Volume I:Foundations of the Handbook of Graph Grammars and C.. (context) - Rozenberg - 1997
2 The Geometry of Optimal Implementation (context) - Mackie - 1994
2 Additive interaction nets (context) - Matsuoka
1 Algebraic Approach to Graph Transformation Part II: Single P.. (context) - Ehrig, Heckel et al. - 1997
1 Presented at APPLIGRAPH Workshop on Applied Graph Transforma.. (context) - Habel, Plump et al. - 2002
1 Compiling AGG into the Network Linear Graph Reduction System (context) - Stewart - 2001
1 Linear naming and computation: experimental software for opt.. (context) - Bawden, Mairson - 1998
1 Rudolf The AGG Approach: Language and Tool Environment (context) - Taentzer, Ermel - 1999
1 Graph rewrite systems for program optimisation (context) - Assman - 2000
Documents on the same site (http://www.cs.tu-berlin.de/cs/ifb/TechnBerichteListe.html): More
Compiler Support for Specification and Justification -.. - Didrich (1999) (Correct)
A Taste of Categorical Petri Nets - Ermel, Martini (1996) (Correct)
Action Nets and Abstract Statecharts in the Theory of.. - Ehrig, Gajewsky, Padberg (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC