Skip to main content
SpringerLink
Log in

Linearly-Used State in Models of Call-by-Value

  • Conference paper
Book cover Algebra and Coalgebra in Computer Science (CALCO 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6859))

Included in the following conference series:

Abstract

We investigate the phenomenon that every monad is a linear state monad. We do this by studying a fully-complete state-passing translation from an impure call-by-value language to a new linear type theory: the enriched call-by-value calculus. The results are not specific to store, but can be applied to any computational effect expressible using algebraic operations, even to effects that are not usually thought of as stateful. There is a bijective correspondence between generic effects in the source language and state access operations in the enriched call-by-value calculus.

From the perspective of categorical models, the enriched call-by-value calculus suggests a refinement of the traditional Kleisli models of effectful call-by-value languages. The new models can be understood as enriched adjunctions.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Day, B.: On closed categories of functors. Lect. Notes Math., vol. 137, pp. 1–38. Springer, Heidelberg (1970)

    Google Scholar 

  2. Egger, J., Møgelberg, R., Simpson, A.: Enriching an effect calculus with linear types. In: Grädel, E., Kahle, R. (eds.) CSL 2009. LNCS, vol. 5771, pp. 240–254. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Egger, J., Møgelberg, R., Simpson, A.: Linearly-used continuations in the enriched effect calculus. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 18–32. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Egger, J., Møgelberg, R., Simpson, A.: The enriched effect calculus (2011) (in preparation)

    Google Scholar 

  5. Fiore, M.P.: Enrichment and representation theorems for categories of domains and continuous functions (March 1996) (unpublished manuscript)

    Google Scholar 

  6. Gordon, R., Power, A.: Enrichment through variation. J. Pure Appl. Algebra 120, 167–185 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Janelidze, G., Kelly, G.: A note on actions of a monoidal category. Theory Appl. of Categ. 9(4), 61–91 (2001)

    MathSciNet  MATH  Google Scholar 

  8. Kelly, G.M.: Adjunction for enriched categories. Lect. Notes Math., vol. 106, pp. 166–177. Springer, Heidelberg (1969)

    Google Scholar 

  9. Kelly, G.M.: Basic Concepts of Enriched Category Theory. Cambridge University Press, Cambridge (1982)

    MATH  Google Scholar 

  10. Levy, P.B.: Call By Push Value. Kluwer, Dordrecht (2003)

    MATH  Google Scholar 

  11. Levy, P., Power, J., Thielecke, H.: Modelling environments in call-by-value programming languages. Inform. and Comput. 185 (2003)

    Google Scholar 

  12. Moggi, E.: Notions of computation and monads. Inform. and Comput. 93, 55–92 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  13. O’Hearn, P.W., Reynolds, J.C.: From Algol to polymorphic linear lambda-calculus. J. ACM 47 (2000)

    Google Scholar 

  14. Plotkin, G.: Call-by-name, call-by-value, and the λ-calculus. Theoret. Comp. Sci. 1, 125–159 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  15. Plotkin, G., Power, J.: Tensors of comodels and models for operational semantics. In: Proc. MFPS XXIV. Electr. Notes Theor. Comput. Sci., vol. 218, pp. 295–311. Elsevier, Amsterdam (2008)

    Google Scholar 

  16. Plotkin, G., Pretnar, M.: A logic for algebraic effects. In: Proc. LICS 2008. IEEE Press, Los Alamitos (2008)

    Google Scholar 

  17. Plotkin, G., Pretnar, M.: Handlers of algebraic effects. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 80–94. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  18. Plotkin, G.D., Power, J.: Notions of computation determine monads. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol. 2303, p. 342. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  19. Plotkin, G.D., Power, J.: Algebraic operations and generic effects. Appl. Categ. Structures 11(1), 69–94 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  20. Power, J., Thielecke, H.: Closed freyd- and κ-categories. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, p. 625. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  21. Power, A.J., Shkaravska, O.: From comodels to coalgebras: State and arrays. In: Proc. CMCS 2004. Electr. Notes Theor. Comput. Sci., vol. 106, pp. 297–314. Elsevier, Amsterdam (2004)

    Google Scholar 

  22. Power, J.: Generic models for computational effects. Theoret. Comput. Sci. 364(2), 254–269 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  23. Power, J., Robinson, E.: Premonoidal categories and notions of computation. Math. Structures Comput. Sci. 7(5), 453–468 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  24. Scott, D.: Mathematical concepts in programming language semantics. In: Proceedings of the Spring Joint Computer Conference, pp. 225–234. ACM, New York (1972)

    Google Scholar 

  25. Strachey, C.: The varieties of programming language. In: Proc. International Computing Symposium, pp. 222–233. Cini Foundation, Venice (1972); Also Tech. Monograph PRG-10, Univ. Oxford (1973)

    Google Scholar 

  26. Street, R.: The formal theory of monads. J. Pure Appl. Algebra 2(2), 149–168 (1972)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IT University of Copenhagen, Denmark

    Rasmus Ejlers Møgelberg

  2. Computer Laboratory, University of Cambridge, UK

    Sam Staton

Authors
  1. Rasmus Ejlers Møgelberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sam Staton
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, 56127, Pisa, Italy

    Andrea Corradini

  2. Faculty of Mathematics, Informatics, and Mechanics, University of Warsaw, ul. Banacha 2, 02-097, Warszawa, Poland

    Bartek Klin

  3. School of Electronics and Computer Science, University of Southampton, SO17 1BJ, Southampton, UK

    Corina Cîrstea

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Møgelberg, R.E., Staton, S. (2011). Linearly-Used State in Models of Call-by-Value. In: Corradini, A., Klin, B., Cîrstea, C. (eds) Algebra and Coalgebra in Computer Science. CALCO 2011. Lecture Notes in Computer Science, vol 6859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22944-2_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22944-2_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22943-5

  • Online ISBN: 978-3-642-22944-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation