Concurrent term rewriting as a model of computation-Reference-Cited by-同舟云学术

Concurrent term rewriting as a model of computation

Published:1987 Issue: Volume: Page:53-93
ISSN:0302-9743
Container-title:Graph Reduction
language:
Short-container-title:

Author:

Goguen Joseph,Kirchner Claude,Meseguer José

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-18420-1_50.pdf

Reference24 articles.

1. Lennart Augustsson. Compiling Pattern-Matching. Technical Report 25, University of Göteborg, Programming Methodology Group, September 1986.

2. John Backus. Can programming be liberated from the von neumann style? Communications of the Association for Computing Machinery, 21(8):613–641, 1978.

3. M. Bauderon and Bruno Courcelle. Graph expressions and graph rewritings. Technical Report, Université de Bordeaux 1, 1985.

4. Gérard Boudol. Computational semantics of term rewriting systems. In Maurice Nivat and John Reynolds, editors, Algebraic Methods in Semantics, pages 169–236, Cambridge University Press, 1985.

5. Cynthia Dwork, Paris Kanellakis, and Larry Stockmeyer. Parallel Algorithms for Term Matching. Technical Report, MIT, 1986.

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. José Meseguer: Scientist and Friend Extraordinaire;Lecture Notes in Computer Science;2015

2. The Existential Fragment of the One-Step Parallel Rewriting Theory;Rewriting Techniques and Applications;2009

3. Rule-Based Programming and Proving: The ELAN Experience Outcomes;Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making;2004

4. A component-based Petri net model for specifying and validating cooperative information systems;Data & Knowledge Engineering;2002-08

5. Experience using an intermediate compiler target language for parallel machines;Microprocessors and Microsystems;1997-05