Abstract
A linear mutual recursion is a recursion that consists of a set of rules, each of which has at most one predicate in its body that is mutually recursive with its head predicate. This paper studies techniques for compilation and efficient evaluation of linear mutual recursions. It demonstrates that a large class of linear mutual recursions can be compiled to one or a set of linear recursions or pseudo-linear recursions and be evaluated efficiently using the well-studied linear recursive query processing techniques and/or their variations. The benefits and limitations of such a compilation and evaluation technique are also discussed in the paper.
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.
