Relating graph and term rewriting via Böhm models

DOI10.1007/BF01293598zbMath0855.68049MaRDI QIDQ1924551

Zena M. Ariola

Publication date: 20 October 1996

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

compiler optimizationsBöhm treeterm graph rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (3)

Lambda calculus with explicit recursion ⋮ Properties of a first-order functional language with sharing ⋮ Skew confluence and the lambda calculus with letrec

Uses Software

• DACTL
• Haskell

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properties of a first-order functional language with sharing
• Algebraic approach to single-pushout graph transformation
• On graph rewritings
• Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
• On ``On graph rewritings
• LEAN: An intermediate language based on graph rewriting
• Graph-grammars and their application to computer science. 2nd International Workshop, Haus Ohrbeck, Germany, October 4-8, 1982. Under the auspices of the European Association for Theoretical Computer Science
• Transfinite reductions in orthogonal term rewriting systems
• REDEX CAPTURING IN TERM GRAPH REWRITING
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• Approximate Reduction and Lambda Calculus Models

This page was built for publication: Relating graph and term rewriting via Böhm models