swMATH ID: 2871
Software Authors: John R. W. Glauert, Richard Kennaway, George A. Papadopoulos, Ronan Sleep
Description: 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.
Homepage: http://link.springer.com/chapter/10.1007/BFb0017401
Keywords: implementation; graph rewriting; functional languages; evaluation strategy; Dactl; translation
Related Software: DIEGO; PROGRES; MONSTR; Miranda; CLEAN; PLT Redex; ML; Coq; PAKCS; Curry; DiaGen; Hy+; Facile; Haskell
Cited in: 27 Publications

Standard Articles

1 Publication describing the Software, including 1 Publication in zbMATH Year
Implementing term rewrite languages in DACTL. Zbl 0698.68013
Kennaway, Richard

Citations by Year