Abstract

We study matching problems for one-sided distributivity. A general method is presented to build up a matching algorithm in an equational theory, and illustrated by the case of one-sided distributivity. Using this algorithm, (right and left) distributivity matching is shown decidable and a method to compute distributive matches is given.Key wordsmatchingdistributivityequational theorydecompositionmergingmutation

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.