Academic
Publications
Towards an Intermediate Language based on Graph Rewriting

Towards an Intermediate Language based on Graph Rewriting,10.1007/3-540-17945-3_9,Hendrik Pieter Barendregt,Marko C. J. D. Van Eekelen,John R. W. Glau

Towards an Intermediate Language based on Graph Rewriting   (Citations: 26)
BibTex | RIS | RefWorks Download
Lean is an experimental language for specifying computations in terms of graph rewriting. It is based on an alternative to Term Rewriting Systems (TRS) in which the terms are replaced by graphs. Such a Graph Rewriting System (GRS) consists of a set of graph rewrite rules which specify how a graph may be rewritten. Besides supporting functional programming, Lean also describes imperative constructs and allows the manipulation of cyclic graphs. Programs may exhibit non-determinism as well as parallelism. In particular, Lean can serve as an intermediate language between declarative languages and machine architectures, both sequential and parallel.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...In the following, we fi x the set of nodesV := N .W e representS ∈G raph as ap air� rt(S) ,s pec� where spec is a sequence containing for each node n ∈ S the triple � n,LS(n),succS(n)� . Following [6], we call such triples node specifications...

    Martin Avanziniet al. Complexity Analysis by Graph Rewriting

    • ...The technique applied is the conventional one of [12,5,6], where terms and rewrite rules are lifted to graphs...

    Steffen van Bakelet al. Explicit Alpha Conversion and Garbage Collection in X (Extended Abstra...

    • ...In our view, for a general term rewriting system the term-graph technology is the best platform for an efficient implementation: this prompted us t o build an interpreter of X using this framework, as first reported on in [ 3]. The technique applied is the conventional one of [15,7,8], where terms and rewrite rules are lifted to graphs...

    Steffen van Bakelet al. Explicit Alpha Conversion and Garbage Collection in X

    • ...Of course it is also possible to define term graphs and term graph rewrite rules directly, without first taking a term or term rewrite rule and lifting it; see [10, 11, 12, 24, 30, 42] for discussions of term graph rewriting and its suitability for programming...
    • ...We assume the reader to be familiar with LC [8], refer to [35, 23] for rewrite systems, and to [12, 10, 11, 30, 38, 42] for definitions of TGRS...

    Steffen Van Bakel. Rank 2 Types for Term Graph Rewriting

    • ...Term graph rewriting has been described in the literature in terms of either category theory notions [12, 13, 14, 15, 22, 27, 30] or more implementation oriented concepts [9, 11, 29, 32]...

    Zena M. Ariola. Relating Graph and Term Rewriting via Böhm Models

Sort by: