A local graph-rewriting system for deciding equality in sum-product theories

DOI10.1016/J.ENTCS.2006.10.031MaRDI QIDQ2867904zbMATH OpenOpenAlexFDO

Authors Jorge Sousa Pinto, Miguel Vilaça, José Bacelar Almeida

Publication date 20 December 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2006.10.031

zbMATH Keywords

graph-based decision procedurepoint-free programming

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2185660
• Extensional Rewriting with Sums
• Term graph rewriting
• On graph rewritings
• scientific article; zbMATH DE number 517053

Cites work

• scientific article; zbMATH DE number 2185660 (Why is no real title available?)
• scientific article; zbMATH DE number 3959364 (Why is no real title available?)
• scientific article; zbMATH DE number 977284 (Why is no real title available?)
• Finite sum-product logic
• Simulating expansions without expansions
• Some lambda calculi with categorical sums and products
• The bologna optimal higher-order machine

Cited in

(1)

• scientific article; zbMATH DE number 3921948 (Why is no real title available?)

This page was built for publication: A local graph-rewriting system for deciding equality in sum-product theories

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