Compilation and evaluation of linear mutual recursions

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish (US)
Pages (from-to)157-183
Number of pages27
JournalInformation Sciences
Issue number1-2
StatePublished - Apr 1 1993
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software
  • Control and Systems Engineering
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence


Dive into the research topics of 'Compilation and evaluation of linear mutual recursions'. Together they form a unique fingerprint.

Cite this