Term graph rewriting

DOI10.1007/3-540-61254-8_16zbMath1407.68241OpenAlexW1503521015MaRDI QIDQ4645801

Jan Willem Klop

Publication date: 11 January 2019

Published in: Higher-Order Algebra, Logic, and Term Rewriting (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61254-8_16

zbMATH Keywords

lambda-calculusgarbage collectionrecursion equationrecursion systemaccess path

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Related Items (1)

Term-Graph Anti-Unification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lambda calculus with explicit recursion
• Infinitary lambda calculus
• Transfinite reductions in orthogonal term rewriting systems
• A complete proof system for Nested Term Graphs
• Explicit substitutions
• Explicit cyclic substitutions

This page was built for publication: Term graph rewriting