Term graph rewriting-Reference-Cited by-同舟云学术

Term graph rewriting

Published:1987 Issue: Volume: Page:141-158
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Barendregt H. P.,Eekelen M. C. J. D.,Glauert J. R. W.,Kennaway J. R.,Plasmeijer M. J.,Sleep M. R.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-17945-3_8.pdf

Reference18 articles.

1. Barendregt, H.P. [1984] The Lambda Calculus: its Syntax and Semantics (revised edition), North-Holland, Amsterdam.

2. Barendregt, H.P., M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer and M.R. Sleep [1986] Term graph rewriting, Report 87, Department of Computer Science, University of Nijmegen, and also as Report SYS-C87-01, School of Information Systems, University of East Anglia.

3. [1987] Towards an intermediate language based on graph rewriting, these proceedings.

4. van den Broek, P.M. and G.F. van der Hoeven [1986] Combinatorgraph reduction and the Church-Rosser theorem, preprint INF-86-15, Department of Informatics, Twente University of Technology.

5. Ehrig, H. [1979] Introduction to the algebraic theory of graph grammars, in: Graph grammars and their Applications in Computer Science and Biology, ed. V. Claus, H. Ehrig, and G. Rozenberg. Lecture notes in Computer Science 73, Springer, Berlin, 1–69.

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

1. Graph IRs for Impure Higher-Order Languages: Making Aggressive Optimizations Affordable with Precise Effect Dependencies;Proceedings of the ACM on Programming Languages;2023-10-16

2. Verifying Term Graph Optimizations using Isabelle/HOL;Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs;2023-01-11

3. String Diagram Rewrite Theory I: Rewriting with Frobenius Structure;Journal of the ACM;2022-03-10

4. Rewrite rule inference using equality saturation;Proceedings of the ACM on Programming Languages;2021-10-20

5. Derivational Complexity and Context-Sensitive Rewriting;Journal of Automated Reasoning;2021-08-12