Compilation and evaluation of linear mutual recursions

DOI10.1016/0020-0255(93)90043-LMaRDI QIDQ1803866zbMATH OpenFDO

Authors Jiawei Han

Publication date 29 June 1993

Published in Information Sciences (Search for Journal in Brave)

zbMATH Keywords

evaluationcompilationlogic programmingmutual recursionrecursive query processingdeductive database programs

Mathematics Subject Classification ID

Logic programming (68N17) Theory of compilers and interpreters (68N20) Database theory (68P15)

Recommendations

• Automatic generation of compiled forms for linear recursions
• On the bottom-up evaluation of recursive queries
• Compilation of extended recursion in call-by-value functional languages
• Magic sets revisited
• Towards an algebraic theory of recursion

Cites work

• scientific article; zbMATH DE number 3978351 (Why is no real title available?)
• Bounds in the propagation of selection into logic programs
• On compiling queries in recursive first-order databases
• On the power of magic
• One-sided recursions
• Towards an algebraic theory of recursion

Cited in

(7)

• scientific article; zbMATH DE number 2114136 (Why is no real title available?)
• scientific article; zbMATH DE number 2006627 (Why is no real title available?)
• scientific article; zbMATH DE number 1406216 (Why is no real title available?)
• Symbolic evaluation with structural recursive symbolic constants
• Automatic generation of compiled forms for linear recursions
• Compilation of extended recursion in call-by-value functional languages
• scientific article; zbMATH DE number 3887103 (Why is no real title available?)

This page was built for publication: Compilation and evaluation of linear mutual recursions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803866)