Compilation and evaluation of linear mutual recursions

DOI10.1016/0020-0255(93)90043-LzbMATH Open0787.68034MaRDI QIDQ1803866FDOQ1803866

Authors: Jiawei Han 

Publication date: 29 June 1993

Published in: Information Sciences (Search for Journal in Brave)

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

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)

Cites Work

• On the power of magic
• On compiling queries in recursive first-order databases
• Title not available (Why is that?)
• Towards an algebraic theory of recursion
• Bounds in the propagation of selection into logic programs
• One-sided recursions

Cited In (7)

• Automatic generation of compiled forms for linear recursions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Compilation of extended recursion in call-by-value functional languages
• Symbolic evaluation with structural recursive symbolic constants
• Title not available (Why is that?)
• Title not available (Why is that?)

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)