Duality between Call-by-Name Recursion and Call-by-Value Iteration
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.
KeywordsIteration Operator Recursion Operator Bijective Correspondence Complete Class Control Category
Unable to display preview. Download preview PDF.
- S. Bloom and Z. Ésik. Iteration Theories. EATC Monographs on Theoretical Computer Science. Springer-Verlarg, 1993.Google Scholar
- Y. Kakutani. Duality between call-by-name recursion and call-by-value iteration. Master’s thesis, Research Institute for Mathematical Sciences, Kyoto University, 2001.Google Scholar
- E. Moggi. Computational lambda-calculus and monads. In 4th LICS Conference. IEEE, 1989.Google Scholar
- C. H. L. Ong and C. A. Stewart. A Curry-Howard foundation for functional computation with control. In Proceedings of ACM SIGPLAN-SIGACT Symposium on Principle of Programming Languages, Paris, January 1997. ACM Press, 1997.Google Scholar
- A. K. Simpson and G. D. Plotkin. Complete axioms for categorical fixedpoint operators. In Proceedings of 15th Annual Symposium on Logic and Computer Science, 2000.Google Scholar
- H. Thielecke. Categorical Structure of Continuation Passing Style. PhD thesis, University of Edinburgh, 1997. Also available as technical report ECS-LFCS-97-376.Google Scholar