A complete proof system for nested term graphs

DOI10.1007/3-540-61254-8_20MaRDI QIDQ4645805zbMATH OpenOpenAlexFDO

Authors 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 holefunction symbolgarbage collectionproof systemunderlying graph

Mathematics Subject Classification ID

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

Recommendations

• Nested term graphs (work in progress)
• A duality between proof systems for cyclic term graphs
• scientific article; zbMATH DE number 919844
• On term-graph rewrite strategies
• A duality in proof systems for recursive type equality and for bisimulation equivalence on cyclic term graphs

Cites work

• A complete inference system for a class of regular behaviours
• scientific article; zbMATH DE number 3512082 (Why is no real title available?)
• scientific article; zbMATH DE number 194911 (Why is no real title available?)
• scientific article; zbMATH DE number 919844 (Why is no real title available?)
• scientific article; zbMATH DE number 233974 (Why is no real title available?)
• scientific article; zbMATH DE number 234035 (Why is no real title available?)
• The lambda calculus. Its syntax and semantics. Rev. ed.

Cited in

(3)

• Term graph rewriting
• Nested term graphs (work in progress)
• A duality between proof systems for cyclic term graphs

This page was built for publication: A complete proof system for nested term graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645805)