Skip to main content
SpringerLink
Log in

A Typed Semantics of Higher-Order Store and Subtyping

  • Conference paper
Theoretical Computer Science (ICTCS 2005)

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

Included in the following conference series:

Abstract

We consider a call-by-value language, with higher-order functions, records, references to values of arbitrary type, and subtyping. We adapt an intrinsic denotational model for a similar language based on a possible-world semantics, recently given by Levy [14], and relate it to an untyped model by a logical relation. Following the methodology of Reynolds [22], this relation is used to establish coherence of the typed semantics, with a coercion interpretation of subtyping. We obtain a typed denotational semantics of (imperative) object-based languages.

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. Abadi, M., Cardelli, L.: A Theory of Objects. Springer, Heidelberg (1996)

    MATH  Google Scholar 

  2. Abadi, M., Cardelli, L., Viswanathan, R.: An interpretation of objects and object types. In: Proc. POPL 1996, pp. 396–409 (1996)

    Google Scholar 

  3. Abadi, M., Leino, K.R.M.: A logic of object-oriented programs. In: Verification: Theory and Practice. Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday. LNCS, pp. 11–41. Springer, Heidelberg (2004)

    Google Scholar 

  4. Abramsky, S., Honda, K., McCusker, G.: A fully abstract game semantics for general references. In: Proc. LICS 1998, pp. 334–344 (1998)

    Google Scholar 

  5. Ahmed, J., Appel, A.W., Virga, R.: A stratified semantics of general references embeddable in higher-order logic. In: Proc. LICS 2002, pp. 75–86 (2002)

    Google Scholar 

  6. Benton, N., Leperchey, B.: Relational reasoning in a nominal semantics for storage. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol. 3461, pp. 86–101. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Breazu-Tannen, V., Coquand, T., Gunter, G., Scedrov, A.: Inheritance as implicit coercion. Information and Computation 93(1), 172–221 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  8. Bruce, K.B., Cardelli, L., Pierce, B.C.: Comparing object encodings. Information and Computation 155(1/2), 108–133 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Honda, K., Berger, M., Yoshida, N.: An observationally complete program logic for imperative higher-order functions. To appear in Proc. LICS 2005 (2005)

    Google Scholar 

  10. Jeffrey, A., Rathke, J.: A fully abstract may testing semantics for concurrent objects. In: Proc. LICS 2002, pp. 101–112 (2002)

    Google Scholar 

  11. Kamin, S.N., Reddy, U.S.: Two semantic models of object-oriented languages. In: Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design, pp. 464–495. MIT Press, Cambridge (1994)

    Google Scholar 

  12. Laird, J.: A categorical semantics of higher-order store. In: Proc. CTCS 2002. ENTCS, vol. 69, pp. 1–18 (2003)

    Google Scholar 

  13. Landin, P.J.: The mechanical evaluation of expressions. Computer Journal 6(4), 308–320 (1964)

    MATH  Google Scholar 

  14. Levy, P.B.: Possible world semantics for general storage in call-by-value. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, p. 232. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. Levy, P.B.: Call-By-Push-Value. A Functional/Imperative Synthesis. Semantic Structures in Computation, vol. 2. Kluwer, Dordrecht (2004)

    Google Scholar 

  16. Mitchell, J.C., Moggi, E.: Kripke-style models for typed lambda calculus. Annals of Pure and Applied Logic 51(1–2), 99–124 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  17. Oles, F.J.: A Category-theoretic approach to the semantics of programming languages. PhD thesis, Syracuse University (1982)

    Google Scholar 

  18. Pitts, A.M.: Relational properties of domains. Information and Computation 127, 66–90 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  19. Reddy, U.S., Yang, H.: Correctness of data representations involving heap data structures. Science of Computer Programming 50(1–3), 129–160 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  20. Reus, B., Schwinghammer, J.: Denotational semantics for Abadi and Leino’s logic of objects. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 264–279. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  21. Reus, B., Streicher, T.: Semantics and logic of object calculi. Theoretical Computer Science 316, 191–213 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  22. Reynolds, J.C.: What do types mean? — From intrinsic to extrinsic semantics. In: Essays on Programming Methodology. Springer, Heidelberg (2002)

    Google Scholar 

  23. Schwinghammer, J.: A typed semantics for languages with higher-order store and subtyping.Technical Report 2005:05, Informatics, University of Sussex (2005)

    Google Scholar 

  24. Smyth, M.B., Plotkin, G.D.: The category-theoretic solution of recursive domain equations. SIAM Journal on Computing 11(4), 761–783 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  25. Stark, I.: Names, equations, relations: Practical ways to reason about new. Fundamenta Informaticae 33(4), 369–396 (1998)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Informatics, University of Sussex, Brighton, UK

    Jan Schwinghammer

Authors
  1. Jan Schwinghammer
    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 Torino,  

    Mario Coppo

  2. Dipartimento di Scienze Matematiche e Informatiche, Università di Siena, Pian dei Mantellini 44, 53100, Siena, Italy

    Elena Lodi

  3. Dipartimento di Matematica e Informatica, Università di Cagliari, P.O. Box

    G. Michele Pinna

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schwinghammer, J. (2005). A Typed Semantics of Higher-Order Store and Subtyping. In: Coppo, M., Lodi, E., Pinna, G.M. (eds) Theoretical Computer Science. ICTCS 2005. Lecture Notes in Computer Science, vol 3701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560586_31

Download citation

  • DOI: https://doi.org/10.1007/11560586_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29106-0

  • Online ISBN: 978-3-540-32024-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation