Abstract
We define here the concept of head boundedness, head normal form and head confluence of term rewriting systems that allow infinite derivations. Head confluence is weaker than confluence, but sufficient to guarantee the correctness of lazy implementations of equational logic programming languages. Then we prove several results. First, if a left-linear system is locally confluent and head-bounded, then it is head-confluent. Second, head-confluent and head-bounded systems have the head Church-Rosser property. Last, if an orthogonal system is head-terminating, then it is head-bounded. These results can be applied to generalize equational logic programming languages.
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 callDisclaimer: 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.
