32 search results - page 2 / 7 » Concurrent Rewriting for Graphs with Equivalences |
PDP
1996
IEEE
13 years 9 months ago
1996
IEEE
FOSSACS
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, includ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We discuss the realization of evaluation strategies for the concurrent constraint-based functional language ccfl within the translation schemata when compiling ccfl programs into t...
GG
2008
Springer
13 years 6 months ago
2008
Springer
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...