Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI
The purpose of this paper is two-fold: first to show how a natural mathematical formulation of the "solution" of a system of recursion equations is formally almost identical with well-known formulations of a solution of a system of "iteration equations." The second aim is to present a construction which takes an algebraic theory T and yields another algebraic theory M(T) whose morphisms correspond to systems of recursion equations over T. This construction is highly uniform, i.e., the correspondence between T and M(T) is functorial. © 1983.
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI
Shu Tezuka
WSC 1991
A.R. Conn, Nick Gould, et al.
Mathematics of Computation
Jianke Yang, Robin Walters, et al.
ICML 2023