Skip to main content

Full abstraction for the second order subset of an ALGOL-like language

  • Contributions
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1994 (MFCS 1994)

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

  • 140 Accesses

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. F. Lent. The category of functors from state shapes to bottomless cpos is adequate for block structure. Master's thesis, M.I.T., Cambridge, Feb. 1992.

    Google Scholar 

  2. R. Loader. The undecidability of λ-definability. Technical report, Mathematical Institute, Oxford University, June 1993.

    Google Scholar 

  3. A. R. Meyer and K. Sieber. Towards fully abstract semantics for local variables: Preliminary report. In Proc. 15th POPL, pages 191–203, San Diego, 1988.

    Google Scholar 

  4. P. W. O'Hearn. Personal communication.

    Google Scholar 

  5. P. W. O'Hearn and R. D. Tennent. Parametricity and local variables. Technical Report SU-CIS-93-30, School of Comp. and Inf. Sc., Syracuse Univ., Oct. 1993.

    Google Scholar 

  6. P. W. O'Hearn and R. D. Tennent. Relational parametricity and local variables. In Proc. 20th POPL, pages 171–184, 1993.

    Google Scholar 

  7. A. M. Pitts and I. D. B. Stark. Observable properties of higher order functions that dynamically create local names, or: What's new? In A. M. Borzyszkowski and S. Sokolowski, editors, Proc. 18th MFCS, LNCS 711, pages 122–141, 1993.

    Google Scholar 

  8. G. D. Plotkin. LCF considered as a programming language. TCS, 5:223–256, 1977.

    Google Scholar 

  9. J. C. Reynolds. The essence of ALGOL. In J. deBakker and van Vliet, editors, Int'l Symp. on Algorithmic Languages, pages 345–372. IFIP, North-Holland, 1981.

    Google Scholar 

  10. K. Sieber. Reasoning about sequential functions via logical relations. In M. P. Fourman, P. T. Johnstone, and A. M. Pitts, editors, Proc. LMS Symposium on Applications of Categories in Computer Science, Durham 1991, LMS Lecture Note Series 177, pages 258–269. Cambridge University Press, 1992.

    Google Scholar 

  11. S. Weeks and M. Felleisen. On the orthogonality of assignments and procedures in Algol. In Proc. 20th POPL, pages 57–70, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Igor Prívara Branislav Rovan Peter Ruzička

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sieber, K. (1994). Full abstraction for the second order subset of an ALGOL-like language. In: Prívara, I., Rovan, B., Ruzička, P. (eds) Mathematical Foundations of Computer Science 1994. MFCS 1994. Lecture Notes in Computer Science, vol 841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58338-6_107

Download citation

  • DOI: https://doi.org/10.1007/3-540-58338-6_107

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58338-7

  • Online ISBN: 978-3-540-48663-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics