Charles Stewart  Home/Search
Context
Related
| linearity.org/cas/abstrac...spggsbm.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: linearity.org/c...educibilityone (more) Homepages: C.Stewart |
Rate this article:      (best)Comment on this article |
Abstract: This paper introduces a general notion of static-port graph grammar (SPGG) that encompasses existing formalisms that have been independently proposed, such as Linear Graph Grammars [Baw93], Interaction Nets [Laf90] and Partial Sharing Graphs [Lam90]. These formalisms have been shown to provide a computational framework for asynchronous computation that respects a very rigorous notion of local interaction, and have proven a suitable basis for the internal representation of program and data in... (Update)
Similar documents (at the sentence level):
70.4%: A Proof of the Reducibility of General Port Graph Grammars to.. - Stewart (2002) (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: Utilizing Constraint Satisfaction Techniques for Efficient Graph.. - Rudolf (1998) (Correct)
Similar documents based on text: More All
0.3: The complexity of the Kn,n-problem for node.. - Konstantin Skodinis (Correct)
0.3: Emptiness problems of eNCE graph languages - K. Skodinis, E. Wanke (1995) (Correct)
0.3: The Bounded Tree-Width Problem of Context-Free Graph Languages - Skodinis (1997) (Correct)
BibTeX entry: (Update)
@misc{ stewart-reducibility,
author = "Charles Stewart",
title = "Reducibility Between Classes of Port Graph Grammar",
note = "Draft version of document, revised version published in Journal of Computer and System Sciences 65(2):169--233, 2002.",
url = "citeseer.ist.psu.edu/stewart01reducibility.html" }
Citations (may not include all citations):866 Techniques and Tools (context) - Aho, Sethi et al. - 1986
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
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 - 1997
16 Connection Graphs (context) - Bawden - 1986
16 A correspondence between Continuation Passing Style and Stat.. - Kelsey - 1995
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 The Geometry of Optimal Implementation (context) - Mackie - 1994
2 Additive interaction nets (context) - Matsuoka
2 Volume I:Foundations of the Handbook of Graph Grammars and C.. (context) - Rozenberg - 1997
http://achilles.bu.edu/linear
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