Towards an algebraic theory of recursion

DOI10.1145/103516.103521zbMath0799.68062OpenAlexW1976844836MaRDI QIDQ4302839

Eugene Wong, Yannis E. Ioannidis

Publication date: 13 November 1994

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://digital.library.wisc.edu/1793/59036

zbMATH Keywords

Horn clausesquery languageslogic programmingnonlinear recursionrecursive query processingclosed semiringalgebraic approaches to semanticsbilinear recursion

Mathematics Subject Classification ID

Database theory (68P15) Logic programming (68N17) Information storage and retrieval of data (68P20) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (5)

Linearisability on Datalog programs ⋮ Magic sets revisited ⋮ Graph traversal and top-down evaluation of logic queries ⋮ An algebraic formulation of the aggregative closure query ⋮ Compilation and evaluation of linear mutual recursions

This page was built for publication: Towards an algebraic theory of recursion