Realizing evaluation strategies by hierarchical graph rewriting

TL;DR

This paper presents a method to implement evaluation strategies for the concurrent constraint-based functional language CCFL by translating it into hierarchical graph rewriting language LMNtal, leveraging LMNtal's features for local computations and process migration.

Contribution

It introduces a novel approach to encode evaluation strategies of CCFL in LMNtal, enabling clear and simple representations through hierarchical graph rewriting.

Findings

Effective encoding of evaluation strategies in LMNtal

Supports local computations and process migration

Facilitates clear translation of CCFL programs

Abstract

We discuss the realization of evaluation strategies for the concurrent constraint-based functional language CCFL within the translation schemata when compiling CCFL programs into the hierarchical graph rewriting language LMNtal. The support of LMNtal to express local computations and to describe the migration of processes and rules between local computation spaces allows a clear and simple encoding of typical evaluation strategies.