Skip to main content
SpringerLink
Log in

Monad Translating Inductive and Coinductive Types

  • Conference paper
  • First Online:
Types for Proofs and Programs (TYPES 2002)

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

Included in the following conference series:

Abstract

We show that the call-by-name monad translation of simply typed lambda calculus extended with sum and product types extends to special and general inductive and coinductive types so that its crucial property of preserving typings and β- and commuting reductions is maintained. Specific similar-purpose translations such as CPS translations follow from the general monad translations by specialization for appropriate concrete monads.

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. Abel, A.: A third-order representation of the λμ-calculus. In: Ambler, S. J., Crole, R. L., Momigliano, A. (eds.): Proc. of Wksh. on Mechanised Reasoning about Languages with Variable Binding, MERLIN 2001 (Siena, June 2001). Electr. Notes in Theor. Comput. Sci., Vol. 58(1). Elsevier, Amsterdam (2001)

    Google Scholar 

  2. Barthe, G., Hatcliff, J., Sørensen, M. H. B.: CPS translations and applications: The cube and beyond. Higher-Order and Symbolic Comput. 12(2) (1999) 125–170

    Article  MATH  Google Scholar 

  3. Barthe, G., Hatcliff, J., Thiemann, P.: Monadic type systems: Pure type systems for impure settings (preliminary report). In: Gordon, A., Pitts, A., Talcott, C. (eds.): Proc. of 2nd Wksh. on Higher-Order Operational Techniques in Semantics, HOOTS’97 (Stanford Univ., CA, Dec. 1997). Electr. Notes in Theor. Comput. Sci., Vol. 10. Elsevier, Amsterdam (1998)

    Google Scholar 

  4. Barthe, G., Uustalu, T.: CPS translating inductive and coinductive types (extended abstract). In: Proc. of 2002 ACM SIGPLAN Wksh. on Partial Evaluation and Semantics-Based Program Manipulation, PEPM’02 (Portland, OR, Jan. 2002). SIGPLAN Notices 37(3). ACM Press, New York (2002) 131–142

    Google Scholar 

  5. Benton, P. N., Bierman, G. M., de Paiva, V. C. V.: Computational types from a logical perspective. J. of Funct. Prog. 8(2) (1998) 177–193

    Article  MATH  Google Scholar 

  6. Cockett, R., Fukushima, T.: About Charity. Yellow Series Report 92/480/18, Dept. of Computer Science, Univ. of Calgary (1992)

    Google Scholar 

  7. Curry, H. B.: The elimination theorem when modality is present. J. of Symb. Logic 17(4) (1952) 249–265

    Article  MATH  MathSciNet  Google Scholar 

  8. Fairtlough, M., Mendler, M.: Propositional lax logic. Inform. and Comput. 137(1) (1997) 1–33

    Article  MATH  MathSciNet  Google Scholar 

  9. Geuvers, H.: Inductive and coinductive types with iteration and recursion. In: Nordström, B., Pettersson, K., Plotkin, G. (eds.): Proc. of Wksh. on Types for Proofs and Programs (Båastad, June 1992). Dept. of Computing Science, Chalmers Univ. of Technology and Göteborg Univ. (1992) 193–217

    Google Scholar 

  10. Hatcliff, J., Danvy, O.: A generic account of continuation passing styles. In: Conf. Record of 21st Ann. ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL’94 (Portland, OR, Jan. 1994). ACM Press, New York (1994) 458–471

    Chapter  Google Scholar 

  11. Leivant, D.: Contracting proofs to programs. In: Odifreddi, P. (ed.): Logic and Computer Science. APIC Studies in Data Processing, Vol. 31. Academic Press, London (1990) 279–327

    Google Scholar 

  12. Mendler, N. P.: Recursive types and type constraints in second-order lambda-calculus. In: Proc. of 2nd Ann. IEEE Symp. on Logic in Computer Science, LICS’87 (Ithaca, NY, June 1987). IEEE CS Press, Washington, DC (1987) 30–36

    Google Scholar 

  13. Mendler, N. P.: Inductive types and type constraints in the second-order lambda-calculus. Ann. of Pure and Appl. Logic, 51(1–2) (1991) 159–172

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  15. Parigot, M.: λμ-calculus: An algorithmic interpretation of classical natural deduction. In: Voronkov, A. (ed.): Proc. of Int. Conf. on Logic Programming and Automated Reasoning, LPAR’92 (St Petersburg, July 1992). Lect. Notes in Artif. Intell., Vol. 624. Springer-Verlag, Berlin (1992) 190–201

    Chapter  Google Scholar 

  16. Plotkin, G. D:: Call-by-name, call-by-value and the λ-calculus. Theor. Comput. Sci. 1(2) (1975) 125–159

    Article  MATH  MathSciNet  Google Scholar 

  17. Spławski, Z., Urzyczyn, P.: Type fixpoints: Iteration vs. recursion. In: Proc. of 4th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP’99 (Paris, Sept. 1999). SIGPLAN Notices 34(9). ACM Press, New York (1999) 102–113

    Google Scholar 

  18. Wadler, P.: Comprehending monads. Math. Struct. in Comp. Sci. 2(4) (1992) 461–493

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Inst. of Cybernetics, Tallinn Technical University, Akadeemia tee 21, EE-12618, Tallinn, Estonia

    Tarmo Uustalu

Authors
  1. Tarmo Uustalu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Nijmegen, Toernooiveld 1, 6525 ED, Nijmegen, The Netherlands

    Herman Geuvers  & Freek Wiedijk  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Uustalu, T. (2003). Monad Translating Inductive and Coinductive Types. In: Geuvers, H., Wiedijk, F. (eds) Types for Proofs and Programs. TYPES 2002. Lecture Notes in Computer Science, vol 2646. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39185-1_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-39185-1_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-14031-3

  • Online ISBN: 978-3-540-39185-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation