Publikationsansicht

Dactl: An Experimental Graph Rewriting Language (1991)

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

Details der Publikation

Download	http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.4244
Quelle	http://www.kypros.org/UCY/ucy/cs/JPL1.ps.gz
Herausgeber	Springer-Verlag
Mitarbeiter	CiteSeerX
Archiv	CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Keywords	Term Graph Rewriting, Functional and Logic Programming, Intermediate (Compiler Target) Languages, Language Embeddings
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