We investigate the duality between call-by-name recursion and call-by-value iteration in the λμ-calculi and their models. Semantically, we consider that iteration is the dual notion of recursion. Syntactically, we extend the call-by-name λμ-calculus and the call-by-value one with a fixed-point operator and an iteration operator, respectively. This paper shows that the dual translations between the call-by-name λμ-calculus and the call-by-value one, which is constructed by Selinger, can be expanded to our extended λμ-calculi. Another result of this study provides uniformity principles for those operators.
CITATION STYLE
Kakutani, Y. (2002). Duality between call-by-name recursion and call-by-value iteration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2471, pp. 506–521). Springer Verlag. https://doi.org/10.1007/3-540-45793-3_34
Mendeley helps you to discover research relevant for your work.