Habel, A. and Plump, D. (2001) Computational Completeness of Programming Languages Based on Graph Transformation. In: Honsell, F. and Miculan, M., (eds.) Foundations of Software Science and Computation Structures : 4th International Conference, FOSSACS 2001: Proceedings. Held as Part of the Joint European Conferences on Theory and Practice of Software. ETAPS 2001, April 2-6, 2001, Genova, Italy. Lecture Notes in Computer Science (2030). Springer-verlag , pp. 230-245.
We identify a set of programming constructs ensuring that a programming language based on graph transformation is computationally complete. These constructs are (1) nondeterministic application of a set of graph transformation rules, (2) sequential composition and (3) iteration. This language is minimal in that omitting either sequential composition or iteration results in a computationally incomplete language. By computational completeness we refer to the ability to compute every computable partial function on labelled graphs. Our completeness proof is based on graph transformation programs which encode arbitrary graphs as strings, simulate Turing machines on these strings, and decode the resulting strings back into graphs.
|Institution:||The University of York|
|Academic Units:||The University of York > Computer Science (York)|
|Depositing User:||York RAE Import|
|Date Deposited:||06 Apr 2009 16:42|
|Last Modified:||06 Apr 2009 16:42|