Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
An operational semantics for parallel lazy evaluation
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
The semantics of graphical languages
Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Parallel Graph Transformation for Model Simulation applied to Timed Transition Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
NiMoToons: a Totally Graphic Workbench for Program Tuning and Experimentation
Electronic Notes in Theoretical Computer Science (ENTCS)
Graphical and incremental type inference: a graph transformation approach
TFP'10 Proceedings of the 11th international conference on Trends in functional programming
| Hi-index | 0.00 |
We present the graph operational semantics approach used for defining NiMo nets execution, which mix lazy, data-driven and a weak form of eager evaluation, all in parallel. NiMo is a totally graphic language from the family of higher order typed languages but with a strong data-flow inspiration. Programs are process networks that evolve showing the full state at each execution step and can be dynamically changed or completed. In NiMo parallelization is implicit. The conjunction of two kinds of tags determine which processes are able to act in the same execution step. According to their tag, processes can behave in five modes that can be globally or locally set for each one, and can be also dynamically changed. Combining modes gives a very flexible way to experiment different strategies to increase processor usage, decrease channel population, and achieve subnet synchronization. Together with symbolic execution it also provides the means for generative and multi-stage programming.