A complete proof system for Nested Term Graphs

DOI10.1007/3-540-61254-8_20zbMath1407.68237OpenAlexW1574241317MaRDI QIDQ4645805

Stefan Blom

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_20

zbMATH Keywords

black holeproof systemunderlying graphgarbage collectionfunction symbol

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42)

Related Items (1)

Term graph rewriting

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• A complete inference system for a class of regular behaviours
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A complete proof system for Nested Term Graphs