Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(5)
Declarative Languages
Graph Rewriting
Support Function
Term Rewrite System
Intermediate Language
Related Publications
(4)
Rewrite Systems
Extending Graph Rewriting with Copying
Term Graph Rewriting
Graph Rewriting Semantics for Functional Programming Languages
Subscribe
Academic
Publications
Towards an Intermediate Language based on Graph Rewriting
Towards an Intermediate Language based on Graph Rewriting,10.1007/3540179453_9,Hendrik Pieter Barendregt,Marko C. J. D. Van Eekelen,John R. W. Glau
Edit
Towards an Intermediate Language based on Graph Rewriting
(
Citations: 26
)
BibTex

RIS

RefWorks
Download
Hendrik Pieter Barendregt
,
Marko C. J. D. Van Eekelen
,
John R. W. Glauert
,
Richard Kennaway
,
Marinus J. Plasmeijer
,
M. Ronan Sleep
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 nondeterminism as well as parallelism. In particular, Lean can serve as an
intermediate language
between
declarative languages
and machine architectures, both sequential and parallel.
Conference:
Parallel Architectures and Languages Europe  PARLE
, pp. 159175, 1987
DOI:
10.1007/3540179453_9
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.
(
www.springerlink.com
)
(
www.springerlink.com
)
(
www.informatik.unitrier.de
)
Citation Context
(10)
...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 Avanzini
,
et 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 Bakel
,
et al.
Explicit Alpha Conversion and Garbage Collection in X (Extended Abstra...
...In our view, for a general term rewriting system the termgraph 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 Bakel
,
et 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
References
(3)
Specification of reduction strategies in term rewriting systems
(
Citations: 6
)
Marko C. J. D. Van Eekelen
,
Marinus J. Plasmeijer
Conference:
Graph Reduction
, pp. 215239, 1986
Equational Logic as a Programming Language
(
Citations: 123
)
Michael J. O'donnell
Conference:
Logic of Programs
, 1985
A Survey of Proposed Architectures for the Execution of Functional Languages
(
Citations: 47
)
Steven R. Vegdahl
Journal:
IEEE Transactions on Computers  TC
, vol. 33, no. 12, pp. 10501072, 1984
Sort by:
Citations
(26)
Complexity Analysis by Graph Rewriting
(
Citations: 3
)
Martin Avanzini
,
Georg Moser
Conference:
Fuji International Symposium on Functional and Logic Programming  FLOPS
, pp. 257271, 2010
Explicit Alpha Conversion and Garbage Collection in X (Extended Abstract)
Steffen van Bakel
,
Jayshan Raghunandan
Published in 2006.
Explicit Alpha Conversion and Garbage Collection in X
Steffen van Bakel
,
Jayshan Raghunandan
Published in 2006.
Implementing X
(
Citations: 5
)
Steffen Van Bakel
,
Jayshan Raghunandan
Journal:
Electronic Notes in Theoretical Computer Science  ENTCS
, vol. 127, no. 5, pp. 171195, 2005
Skew and omegaSkew Confluence and Abstract Böhm Semantics
(
Citations: 1
)
Zena M. Ariola
,
Stefan Blom
,
A. Middeldorp
Conference:
Birthday ...
, pp. 368403, 2005