Skip to main content
SpringerLink
Log in
Book cover

Workshop on Logic of Programs

Logic of Programs 1985: Logics of Programs pp 219–224Cite as

Continuation semantics in typed lambda-calculi

Summary

  • Conference paper
  • First Online:

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

Abstract

This paper reports preliminary work on the semantics of the continuation transform. Previous work on the semantics of continuations has concentrated on untyped lambda-calculi and has used primarily the mechanism of inclusive predicates. Such predicates are easy to understand on atomic values, but they become obscure on functional values. In the case of the typed lambda-calculus, we show that such predicates can be replaced by retractions. The main theorem states that the meaning of a closed term is a retraction of the meaning of the corresponding continuationized term.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abelson, H., and Sussman, G.J. The Structure and Interpretation of Computer Programs, MIT Press, Cambridge, MA, 1985.

    Google Scholar 

  2. Hoare, C.A.R., “Proving Correctness of Data Representations,” Acta Informatica 1 (1972), 271–281.

    Google Scholar 

  3. Meyer, A.R. “What Is a Model of the Lambda Calculus?” Information and Control 52 (1982), 87–122.

    Google Scholar 

  4. Plotkin, G.D. “Call-by-Name, Call-by-Value and the λ-Calculus,” Theoret. Comp. Sci. 1 (1975) 125–159.

    Google Scholar 

  5. Reynolds, J.C. “On the Relation between Direct and Continuation Semantics,” Proc. 2nd Colloq. on Automata, Languages, and Programming (Saarbrucken, 1974) Springer Lecture Notes in Computer Science, Vol. 14 (Berlin: Springer, 1974) 141–156.

    Google Scholar 

  6. Sethi, R. and Tang, A. “Constructing Call-by-value Continuation Semantics,” J. ACM 27 (1980), 580–597.

    Google Scholar 

  7. Stoy, J.E. “The Congruence of Two Programming Language Definitions,” Theoret. Comp. Sci. 13 (1981), 151–174.

    Google Scholar 

  8. Strachey, C. and Wadsworth, C.P. “Continuations: A Mathematical Semantics for Handling Full Jumps,” Oxford University Computing Laboratory Technical Monograph PRG-11 (January, 1974).

    Google Scholar 

  9. Wand, M. “A Types-as-Sets Semantics for Milner-style Polymorphism,” Conf. Rec. 11th ACM Symp. on Principles of Programming Languages (1984), 158–164.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, 02139, Cambridge, MA

    Albert R. Meyer

  2. Computer Science Department, Brandeis University, 02254, Waltham, MA

    Mitchell Wand

Authors
  1. Albert R. Meyer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mitchell Wand
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rohit Parikh

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meyer, A.R., Wand, M. (1985). Continuation semantics in typed lambda-calculi. In: Parikh, R. (eds) Logics of Programs. Logic of Programs 1985. Lecture Notes in Computer Science, vol 193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15648-8_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-15648-8_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15648-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation