Publikationsansicht

Dactl: An experimental graph rewriting language (1990)

Abstract

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.

Details der Publikation

Download	http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.2895
Quelle	http://www.cs.ucy.ac.cy/~george/JPLa.pdf
Herausgeber	Springer-Verlag
Mitarbeiter	CiteSeerX
Archiv	CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Keywords	term graph rewriting
Typ	text
Sprache	Englisch
Verknüpfungen	10.1.1.52.3741, 10.1.1.49.8638, 10.1.1.49.2126, 10.1.1.54.2455, 10.1.1.33.8120, 10.1.1.107.7964, 10.1.1.28.4907, 10.1.1.56.6429, 10.1.1.57.3111, 10.1.1.57.1385, 10.1.1.104.3193, 10.1.1.31.1628, 10.1.1.26.20, 10.1.1.45.2079, 10.1.1.49.2126, 10.1.1.27.5030, 10.1.1.33.8120, 10.1.1.44.8497, 10.1.1.53.6758, 10.1.1.54.2455, 10.1.1.53.4688, 10.1.1.12.9116, 10.1.1.49.4867, 10.1.1.51.7570, 10.1.1.52.8833, 10.1.1.70.2467, 10.1.1.70.4717, 10.1.1.72.4169, 10.1.1.72.8582, 10.1.1.96.5277, 10.1.1.97.6520, 10.1.1.121.6436, 10.1.1.55.8434, 10.1.1.50.3855