Abstract
We propose an axiomatization of fixpoint operators in typed call-by-value programming languages, and give its justifications in two ways. First, it is shown to be sound and complete for the notion of uniform T-fixpoint operators of Simpson and Plotkin. Second, the axioms precisely account for Filinski’s fixpoint operator derived from an iterator (infinite loop constructor) in the presence of first-class controls, provided that we define the uniformity principle on such an iterator via a notion of effect-freeness (centrality). We also investigate how these two results are related in terms of the underlying categorical models.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bloom, S. and Esik, Z. (1993) Iteration Theories. EATCS Monographs on Theoretical Computer Science, Springer-Verlag.
Crole, R.L. and Pitts, A.M. (1992) New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic. Inform. and Comput. 98(2), 171–210.
Filinski, A. (1989) Declarative continuations: an investigation of duality in programming language semantics. In Proc. Category Theory and Computer Science, Springer Lecture Notes in Comput. Sci. 389, pp. 224–249.
Filinski, A.(1994) Recursion from iteration. Lisp and Symbolic Comput. 7(1),11–38.
Filinski, A. (1996) Controlling Effects. PhD thesis, Carnegie Mellon University, CMU-CS-96-119.
Flanagan, C., Sabry, A., Duba, B.F. and Felleisen, M. (1993) The essence of compiling with continuations. In Proc. ACM Conference on Programming Languages Design and Implementation, pp. 237–247.
Fuhrmann, C. (2000) The Structure of Call-by-Value. PhD thesis, University of Edinburgh.
Harper, R., Duba, B.F. and MacQueen, D. (1993) Typing first-class continuations in ML. J. Funct. Programming 3(4), 465–484.
Hasegawa, M. (1997) Models of Sharing Graphs: A Categorical Semantics of let and letrec. PhD thesis, University of Edinburgh, ECS-LFCS-97-360; also in Distinguished Dissertation Series, Springer-Verlag, 1999.
Hofmann, M. (1995) Sound and complete axiomatisations of call-by-value control operators. Math. Structures Comput. Sci. 5(4), 461–482.
Kakutani, Y. (2001) Duality between Call-by-Name Recursion and Call-by-Value Iteration. MSc thesis, Kyoto University.
Moggi, E. (1989) Computational lambda-calculus and monads. In Proc. 4th Annual Symposium on Logic in Computer Science, pp. 14–23.
Parigot, M. (1992) λμ-calculus: an algorithmic interpretation of classical natural deduction. In Proc. International Conference on Logic Programming and Automated Reasoning, Springer Lecture Notes in Comput. Sci. 624, pp. 190–201.
Plotkin, G.D. (1975) Call-by-name, call-by-value, and the λ-calculus. Theoret. Comput. Sci. 1(1), 125–159.
Power, A.J. and Robinson, E.P. (1997) Premonoidal categories and notions of computation. Math. Structures Comput. Sci. 7(5), 453–468.
Sabry, A. and Felleisen, M. (1992) Reasoning about programs in continuation-passing style. In Proc. ACM Conference on Lisp and Functional Programming, pp. 288–298; extended version in Lisp and Symbolic Comput. 6(3/4), 289-360, 1993.
Selinger, P. (2001) Control categories and duality: on the categorical semantics of the lambda-mu calculus. To appear in Math. Structures Comput. Sci.
Simpson, A.K. and Plotkin, G.D. (2000) Complete axioms for categorical fixedpoint operators. In Proc. 15th Annual Symposium on Logic in Computer Science.
Thielecke, H. (1997) Categorical Structure of Continuation Passing Style. PhD thesis, University of Edinburgh, ECS-LFCS-97-376.
Thielecke, H. (1999) Using a continuation twice and its implications for the expressive power of call/cc. Higher-Order and Symbolic Comput. 12(1), 47–73.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hasegawa, M., Kakutani, Y. (2001). Axioms for Recursion in Call-by-Value. In: Honsell, F., Miculan, M. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2001. Lecture Notes in Computer Science, vol 2030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45315-6_16
Download citation
DOI: https://doi.org/10.1007/3-540-45315-6_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41864-1
Online ISBN: 978-3-540-45315-4
eBook Packages: Springer Book Archive