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

DOI10.1016/J.ENTCS.2006.10.031zbMATH Open1278.68115OpenAlexW1984602545MaRDI QIDQ2867904FDOQ2867904

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

Recommendations

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

zbMATH Keywords

graph-based decision procedurepoint-free programming

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)

• Title not available (Why is that?)

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)