Skip to main content

Duality between Call-by-Name Recursion and Call-by-Value Iteration

  • Conference paper
  • First Online:
Computer Science Logic (CSL 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2471))

Included in the following conference series:

  • 584 Accesses

  • 16 Citations

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. S. Bloom and Z. Ésik. Iteration Theories. EATC Monographs on Theoretical Computer Science. Springer-Verlarg, 1993.

    Google Scholar 

  2. A. Filinski. Declarative continuations: an investigation of duality in programming language semantics. In Category Theory and Computer Science, volume 389 of LNCS, pages 224–249. Springer-Verlag, 1989.

    Chapter  Google Scholar 

  3. A. Filinski. Recursion from iteration. Lisp and Symbolic Computation, 7:11–38, 1994.

    Article  Google Scholar 

  4. C. Führmann. Varieties of effects. In Foundations of Software Science and Computation Structures, volume 2303 of LNCS, pages 144–158. Springer-Verlag, 2002.

    Chapter  Google Scholar 

  5. M. Hasegawa and Y. Kakutani. Axioms for recursion in call-by-value. In Foundations of Software Science and Computation Structures, volume 2030 of LNCS, pages 246–260. Springer-Verlag, 2001.

    Chapter  Google Scholar 

  6. H. Huwig and A. Poigne. A note on inconsistencies caused by fixpoints in a cartesian closed category. Theoretical Computer Science, 73(1):101–112, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  7. 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 

  8. E. Moggi. Computational lambda-calculus and monads. In 4th LICS Conference. IEEE, 1989.

    Google Scholar 

  9. 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 

  10. M. Parigot. λμ-calculus: An algorithmic interpretation of classical natural deduction. In Logic Programming and Automated Reasoning, volume 624 of LNCS, pages 190–201. Springer-Verlag, 1992.

    Chapter  Google Scholar 

  11. A. J. Power and E. P. Robinson. Premonoidal categories and notions of computation. Mathematical Structures in Computer Science, 7(5):453–468, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  12. P. Selinger. Control categories and duality: on the categorical semantics of the lambda-mu calculus. Mathematical Structures in Computer Science, 11(2):207–260, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  13. 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 

  14. 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kakutani, Y. (2002). Duality between Call-by-Name Recursion and Call-by-Value Iteration. In: Bradfield, J. (eds) Computer Science Logic. CSL 2002. Lecture Notes in Computer Science, vol 2471. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45793-3_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-45793-3_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44240-0

  • Online ISBN: 978-3-540-45793-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics