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 definition of the syntax and semantics of the language. Some implementation issues are also discussed.


References in zbMATH (referenced in 27 articles , 1 standard article )

Showing results 1 to 20 of 27.
Sorted by year (citations)

1 2 next

  1. Danvy, Olivier; Zerny, Ian: Three syntactic theories for combinatory graph reduction (2011)
  2. Echahed, Rachid: On term-graph rewrite strategies. (2008)
  3. Crégut, Pierre: Strongly reducing variants of the Krivine abstract machine (2007)
  4. Duval, Dominique; Echahed, Rachid; Prost, Frédéric: Modeling pointer redirection as cyclic term-graph rewriting. (2007)
  5. Sinot, François-Régis; Mackie, Ian: Macros for interaction nets: A conservative extension of interaction nets. (2005)
  6. Drewes, Frank; Hoffmann, Berthold; Plump, Detlef: Hierarchical graph transformation (2002)
  7. Habel, Annegret; Plump, Detlef: Computational completeness of programming languages based on graph transformation (2001)
  8. Panangaden, P.; Verbrugge, C.: Generating irregular partitionable data structures (2000)
  9. 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)
  10. Kreowski, Hans-Jörg; Kuske, Sabine: Graph transformation units with interleaving semantics (1999)
  11. Banach, R.: MONSTR I -- Fundamental issues and the design of MONSTR (1998)
  12. Banach, R.: MONSTR II -- suspending semantics and independence (1997)
  13. Fu, James Jianghai: Directed graph pattern matching and topological embedding (1997)
  14. Glauert, John: Object graph rewriting: An experimental parallel implementation (1997)
  15. Ariola, Zena M.: Relating graph and term rewriting via Böhm models (1996)
  16. Banach, R.: Transitive term graph rewriting (1996)
  17. Ariola, Zena M.; Arvind: Properties of a first-order functional language with sharing (1995)
  18. Shand, Duncan; Brock, Simon: Proofs as graphs. (1995)
  19. Sleep, M.Ronan: SEMAGRAPH: The theory and practice of term graph rewriting. (1995)
  20. Banach, R.: Term graph rewriting and garbage collection using opfibrations (1994)

1 2 next