John R. W. Glauert, Richard Kennaway, George A. Papadopoulos, Ronan Sleep  Home/Search
Context Related
| cs.ucy.ac.cy/JPL1.ps.gz kypros.org/UCY/ucy/cs/JPL1.ps.gz cs.ucy.ac.cy/~george/JPL1.ps.gz 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.ucy.ac.cy/george5 (more) From: kypros.org/UCY/ucy/cs/george5 (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper gives some examples of how computation in a number of languages may be described as graph rewriting, giving the Dactl notation for the examples shown. It goes on to present the Dactl model more formally before giving a formal definition of the syntax and semantics of the language. 2 Examples of Computation by Graph Rewriting (Update)
Context of citations to this paper: More
...until the original caller activates it again. A more elaborate description of Dactl can be found in the accompanying paper (Glauert et al. 1997). 2 Concurrent logic languages Concurrent logic languages (CLLs) comprise a family of languages based on a subset of first order...
...tasks such as graph drawing and algorithm animation. Previous graph rewriting languages include GOOD [15] Progres [18] Dactl MONSTR [7,1] and D grammar programming [11] each of which has a unique interpretation of programming with graph rewrites. These graph rewriting...
Cited by: More
Visual Programming with Graph Rewriting Systems - Schürr, Winter, Zündorf (1995) (Correct)
Hierarchical Graph Transformation - Drewes, Hoffmann, Plump (2002) (Correct)
Generating Irregular Partitionable Data Structures - Panangaden, Verbrugge (Correct)
Active bibliography (related documents): More All
1.2: Experience Using an Intermediate Compiler Target Language for.. - Papadopoulos (Correct)
1.2: Implementing Concurrent Logic and Functional Languages in Dactl - Papadopoulos (1997) (Correct)
0.8: Multi-Paradigm Programming through Graph Rewriting: Case for.. - Glauert (Correct)
Similar documents based on text: More All
0.4: Parallel Term Graph Rewriting and Concurrent Logic Programs - Banach, Papadopoulos (Correct)
0.4: DACTL Rewriting is Categorical - Banach (1991) (Correct)
0.4: MONSTR I - Fundamental Issues and the Design of MONSTR - Banach (1996) (Correct)
Related documents from co-citation: More All
22: Graph Grammars and Their Application to Computer Science and Biology (context) - Claus, Ehrig et al. - 1979
11: Term Graph Rewriting (context) - Barendregt, Eekelen et al.
11: Workshop on Graph Grammars and Their Application to Computer Science and Biology (context) - Claus, Ehrig et al. - 1979
BibTeX entry: (Update)
Glauert J. R. W., Kennaway J. R. and Sleep M. R., `Dactl: An Experimental Graph Rewriting Language', Proc. GRA GRA, LNCS 532, Springer Verlag, 1990, pp 378395. http://citeseer.ist.psu.edu/glauert91dactl.html More
@inproceedings{ glauert91dactl,
author = "John Glauert and Richard Kennaway and Ronan Sleep",
title = "{Dactl: An Experimental Graph Rewriting Language}",
booktitle = "Proc.\ 4th. Int.\ Workshop on Graph Grammars and their Application to Computer Science",
volume = "532",
publisher = "Springer-Verlag",
editor = "Hartmut Ehrig and Hans-J{\"o}rg Kreowski and Grzegorz Rozenberg",
pages = "378--395",
year = "1991",
url = "citeseer.ist.psu.edu/glauert91dactl.html" }
Citations (may not include all citations):788 Rewrite Systems - Dershowitz, Jouannaud - 1990
521 Compiling with Continuations (context) - Appel - 1992
474 Term rewriting systems - Klop - 1990
359 The Implementation of Functional Programming Languages (context) - Jones - 1987
247 The Family of Concurrent Logic Programming Languages (context) - Shapiro - 1989
119 Facile: A Symmetric Integration of Concurrent and Functional.. (context) - Giacalone, Mishra et al. - 1989
72 Semantics and pragmatics of the lambda-calculus (context) - Wadsworth - 1971
61 Term Graph Rewriting: Theory and Practice (context) - Sleep, Plasmeijer et al. - 1993
39 The Spineless Tagless G-Machine (context) - Jones, Salkild - 1989
26 Flagship: A Parallel Architecture for Declarative Programmin.. (context) - Watson, Woods et al. - 1988
25 Parallel Logic Programming in PARLOG The Language and its Im.. (context) - Gregory - 1987
20 Implementing Term Rewrite Languages in Dactl (context) - Kennaway - 1990
19 Final Specification of Dactl (context) - Glauert, Kennaway et al. - 1988
14 MONSTR: Term Graph Rewriting for Parallel Machines - Banach
14 Computation on graph-like expressions (context) - Staples - 1980
13 Parallel SML: A Functional Language and its Implementation i.. (context) - Hammond - 1990
11 Using Dactl to Implement Declarative Languages (context) - Glauert, Hammond et al. - 1988
11 A correctness proof for combinator reduction with cycles (context) - Farmer, Ramsdell et al. - 1990
11 A Parallel Implementation of GHC (context) - Glauert, Papadopoulos - 1988
10 Jungle Evaluation for Efficient Term Rewriting (context) - Hoffmann, Plump - 1988
10 Dealing with State in Flagship: The MONSTR Computational Mod.. (context) - Banach, Watson - 1988
10 Asynchronous Mobile Processes and Graph Rewriting - Glauert - 1992
9 Web automata and web grammars (context) - Rosenfeld, Milgram - 1972
9 Lecture Notes in Computer Science (context) - Barendregt, van Eekelen et al. - 1987
8 On graph rewritings (context) - Raoult - 1984
6 Optimal evaluations of graph-like expressions (context) - Staples - 1980
6 Programming with equations (context) - Hoffmann, O'Donnell - 1982
5 Parallel Implementation of Concurrent Logic Languages Using .. (context) - Papadopoulos - 1989
3 Lean: An Intermediate Language Based on Graph Rewriting (context) - Barendregt, van Eekelen et al. - 1989
3 A Study of Two Graph Rewriting Formalisms: Interaction Nets .. - Banach, Papadopoulos - 1997
3 Object-Oriented Term Graph Rewriting - Papadopoulos - 1997
3 Parallel Implementations of Declarative Languages based on G.. (context) - Hammond, Papadopoulos - 1988
2 Graph rewriting in a category of partial morphisms (context) - Kennaway - 1990
2 The correctness of an implementation of functional Dactl by .. (context) - Kennaway - 1988
1 Implementing Concurrent Logic and Functional Languages in Da.. - Papadopoulos - 1997
1 Concurrent Object-Oriented Programming Using Term Graph Rewr.. - Papadopoulos - 1996
1 th ACM POPL (context) - Lafont - 1990
1 Syntax and informal semantics of DyNe (context) - Kennaway, Sleep - 1983
1 Gra Gra: Computing by Graph Transformation (context) - Ehrig, Lowe - 1989
1 A New Process Model for Functions in Term Graph Rewriting (context) - Glauert, Leth et al. - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.ucy.ac.cy/george5.html): More
Experience Using an Intermediate Compiler Target Language for.. - Papadopoulos (Correct)
Control-Driven Coordination Programming in Shared Dataspace - George Papadopoulos (1997) (Correct)
Object-Oriented Term Graph Rewriting - Papadopoulos (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