Abstract
Clean is an experimental language for specifying functional computations in terms of graph rewriting. It is based on an extension of Term Rewriting Systems (TRS) in which the terms are replaced by graphs. Such a Graph Rewriting System (GRS) consists of a, possibly cyclic, directed graph, called the data graph and graph rewrite rules which specify how this data graph may be rewritten. Clean is designed to provide a firm base for functional programming. In particular, Clean is suitable as an intermediate language between functional languages and (parallel) target machine architectures. A sequential implementation of Clean on a conventional machine is described and its performance is compared with other systems. The results show that Clean can be efficiently implemented.
Cite
CITATION STYLE
Brus, T. H., van Eekelen, M. C. J. D., van Leer, M. O., & Plasmeijer, M. J. (1987). Clean — A language for functional graph rewriting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 274 LNCS, pp. 364–384). Springer Verlag. https://doi.org/10.1007/3-540-18317-5_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
