Bisimilarity in term graphs rewriting (2007)
Z. M. Ariola, J. W. Klop, D. Plump, Issn -x, Mathematisch Centrum (smc, The Dutch Foundation, ...
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
ABSTRACT Bisimilarity in Term Graph Rewriting (1998)
Z. M. Ariola, J. W. Klop, D. Plump, Issn -x, Copyright Stichting, Mathematisch Centrum, ...
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Lambda Calculus with Explicit Recursion (1996)
Z. M. Ariola, J. W. Klop, Issn -x, Zena M. Ariola, Jan-Willem Klop
This paper is concerned with the study of -calculus with explicit recursion, namely of cyclic -graphs. The starting point is to treat a -graph as a system of recursion equations involving -terms, and...
Z. M. Ariola, J. W. Klop, Issn -x, Zena M. Ariola, Jan Willem Klop
We present an equational framework for term graph rewriting with cycles. The usual notion of homomorphism is phrased in terms of the notion of bisimulation, which is well-known in process algebra and...
A Common Intermediate Language and its Use in Partitioning Concurrent Declarative Programs (1996)
Z. M. Ariola, B. C. Massey, M. Sami, E. Tick, John Dryden
The plethora of concurrent declarative language families, each with subtly different semantics, makes the design and implementation of static analyses for these languages a demanding task. However,...
Compilation of Concurrent Declarative Languages (1995)
Z. M. Ariola, M. Sami, B. C. Massey, E. Tick
The plethora of concurrent declarative language families, each with subtly different semantics, makes the design and implementation of static analyses for these languages a demanding task. However,...
Compilation of Concurrent Declarative Languages (1995)
Ariola Massey, Z. M. Ariola, B. C. Massey, M. Sami, E. Tick
The plethora of concurrent declarative language families, each with subtly different semantics, makes the design and implementation of static analyses for these languages a demanding task. However,...
Graph Rewriting Systems For Efficient Compilation (1993)
This paper is based on the PhD thesis of Zena M. Ariola [Ari92] where complete proofs and more examples with explanations may be found. 6.2 SYNTAX OF GRS