[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

On the Relation between Direct and Continuation Semantics

  • Conference paper
Automata, Languages and Programming (ICALP 1974)

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

Included in the following conference series:

Abstract

The use of continuations in the definition of programming languages has gained considerable currency recently, particularly in conjunction with the lattice-theoretic methods of D. Scott. Although continuations are apparently needed to provide a mathematical semantics for non-applicative control features, they are unnecessary for the definition of a purely applicative language, even when call-by-value occurs. This raises the question of the relationship between the direct and the continuation semantic functions for a purely applicative language. We give two theorems which specify this relationship and show that, in a precise sense, direct semantics are included in continuation semantics.

The heart of the problem is the construction of a relation which must be a fixed-point of a non-monotonic “relational functor.” A general method is given for the construction of such relations between recursively defined domains.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.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
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 27.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 35.99
Price includes VAT (United Kingdom)
  • 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.

Similar content being viewed by others

References

  1. Morris, L., The Next 700 Programming Language Descriptions. Unpublished.

    Google Scholar 

  2. Strachey, C. and Wadsworth, C. P., Continuations - A Mathematical Semantics for Handling Full Jumps. Tech. Monograph PRG-11, Programming Research Group Oxford University Computing Laboratory, January 1974.

    Google Scholar 

  3. Reynolds, J. C., “Definitional Interpreters for Higher-Order Programming Languages”, Proc. 25th National ACM Conference, Boston, August 1972.

    Google Scholar 

  4. Tennent, R. D., Mathematical Semantics and Design of Programming Languages. Ph.D. Thesis, University of Toronto, October, 1973.

    Google Scholar 

  5. Landin, P. J., “A Correspondence Between ALGOL 60 and Church’s Lambda-Notation”. Comm ACM 8 (February-March 1965), 89–101 and 158–165.

    Google Scholar 

  6. Scott, D., “Lattice-Theoretic Models for Various Type-Free Calculi,” Proc. Fourth International Congress for Logic, Methodology, and the Philosophy of Science, Bucharest (1972).

    Google Scholar 

  7. Naur, P., et al. Revised Report on the Algorithmic Language ALGOL 60. Comm ACM 6, 1 (January 1963), 1–17.

    Google Scholar 

  8. Scott, D., “Continuous Lattices,” Proc. 1971 Dalhousie Conf., Springer Lecture Note Series, Springer-Verlag, Heidelberg. Also, Tech. Monograph PRG-7, Programming Research Group, Oxford University Computing Laboratory, August 1971.

    Google Scholar 

  9. Reynolds, J. C., “Notes on a Lattice-Theoretic Approach to the Theory of Computation”, Systems and Information Science, Syracuse University, October 1972.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reynolds, J.C. (1974). On the Relation between Direct and Continuation Semantics. In: Loeckx, J. (eds) Automata, Languages and Programming. ICALP 1974. Lecture Notes in Computer Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21545-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-21545-6_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06841-9

  • Online ISBN: 978-3-662-21545-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics