We present an algorithm for lambda expression reduction that avoids any copying that could
later cause duplication of work. It is optimal in the sense defined by Lévy. The basis of the …

Concurrent Clean is an experimental, lazy, higher-order parallel functional programming
language based on term graph rewriting. An important difference with other languages is …

Map L-systems have been successfully applied in the past decade to the study of cell
division patterns and plant morphogenesis. They are used to describe the spatial-temporal …

Dactl is an experimental language programming language based on fine grain graph
transformations. It was developed in the context of a large parallel reduction machine …

Optimizations performed by compilers, usually expressed as rewrites on program graphs,
are a core part of modern compilers. However, even production compilers have bugs, and …

In an ideal situation these phases are strict sequential and the interfaces are unambiguous.
But, in many situations these phases are not clearly separable and sequential. The definition …

Honda and Tokoro provide a formal system for communicating systems developed from
Milner's π-calculus. Unlike other formalisms, their work is based on asynchronous …

The research presented in this thesis is about the design and implementation of Naira, a
parallel, parallelising compiler for a rich, purely functional programming language. The …

A generalized computational model based on graph rewriting is presented along with Dactl,
an associated compiler target (intermediate) language. An illustration of the capability of …

Software reengineering is the repair and reuse of existing computer software. Its practice
attempts to add the qualities of maintainability and understandability to existing software with …