Realizing evaluation strategies by hierarchical graph rewriting
Petra Hofstedt

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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModel-Driven Software Engineering Techniques · Logic, programming, and type systems · Semantic Web and Ontologies
