DACTL
A generalized computational model based on graph rewriting is presented along with Dactl, an associated compiler target (intermediate) language. An illustration of the capability of graph rewriting to model a variety of computational formalisms is presented by showing how some examples written originally in a number of languages can be described as graph rewriting transformations using Dactl notation. This is followed by a formal presentation of the Dactl model before giving a formal deﬁnition of the syntax and semantics of the language. Some implementation issues are also discussed.
Keywords for this software
References in zbMATH (referenced in 24 articles , 1 standard article )
Showing results 1 to 20 of 24.
Sorted by year (- Zerny, Ian: On graph rewriting, reduction, and evaluation in the presence of cycles (2013)
- Danvy, Olivier; Zerny, Ian: Three syntactic theories for combinatory graph reduction (2011)
- Crégut, Pierre: Strongly reducing variants of the Krivine abstract machine (2007)
- Drewes, Frank; Hoffmann, Berthold; Plump, Detlef: Hierarchical graph transformation (2002)
- Habel, Annegret; Plump, Detlef: Computational completeness of programming languages based on graph transformation (2001)
- Panangaden, P.; Verbrugge, C.: Generating irregular partitionable data structures (2000)
- Andries, Marc; Engels, Gregor; Habel, Annegret; Hoffmann, Berthold; Kreowski, Hans-Jörg; Kuske, Sabine; Plump, Detlef; Schürr, Andy; Taentzer, Gabriele: Graph transformation for specification and programming (1999)
- Kreowski, Hans-Jörg; Kuske, Sabine: Graph transformation units with interleaving semantics (1999)
- Banach, R.: MONSTR I -- Fundamental issues and the design of MONSTR (1998)
- Banach, R.: MONSTR II -- suspending semantics and independence (1997)
- Fu, James Jianghai: Directed graph pattern matching and topological embedding (1997)
- Glauert, John: Object graph rewriting: An experimental parallel implementation (1997)
- Ariola, Zena M.: Relating graph and term rewriting via Böhm models (1996)
- Banach, R.: Transitive term graph rewriting (1996)
- Ariola, Zena M.; Arvind: Properties of a first-order functional language with sharing (1995)
- Banach, R.: Term graph rewriting and garbage collection using opfibrations (1994)
- Bolton, David; Hankin, Chris; Kelly, Paul: An operational semantics for paragon: A design notation for parallel architectures (1991)
- Glauert, J. R. W.; Kennaway, J. R.; Sleep, M. R.: Dactl: An experimental graph rewriting language. (1991) ioport
- Kennaway, Richard: Graph rewriting in some categories of partial morphisms (1991)
- Holm, Kristoffer Høgsbro: Graph matching in operational semantics and typing (1990)