Realizing evaluation strategies by hierarchical graph rewriting
Logic in Computer Science
2010-09-21 v1 Programming Languages
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.
Cite
@article{arxiv.1009.3770,
title = {Realizing evaluation strategies by hierarchical graph rewriting},
author = {Petra Hofstedt},
journal= {arXiv preprint arXiv:1009.3770},
year = {2010}
}
Comments
Online proceedings of the Joint Workshop on Implementation of Constraint Logic Programming Systems and Logic-based Methods in Programming Environments (CICLOPS-WLPE 2010), Edinburgh, Scotland, U.K., July 15, 2010