Realizing evaluation strategies by hierarchical graph rewriting

Details Realizing evaluation strategies by hierarchical graph rewriting Realizing evaluation strategies by hierarchical graph rewriting

2010-09-20

arxiv.org/abs/1009.3770v1

Computer Science

Logic in Computer Science

Online proceedings of the Joint Workshop on Implementation of Constraint Logic Programming Systems and Logic-based Methods in

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Realizing evaluation strategies by hierarchical graph rewriting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Realizing evaluation strategies by hierarchical graph rewriting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Realizing evaluation strategies by hierarchical graph rewriting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-264395