Skip to main content

Deriving stack semantics congruent to standard denotational semantics

  • Conference paper
  • First Online:
STACS 85 (STACS 1985)

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

Included in the following conference series:

  • 123 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. R. Milne & C. Strachey "A theory of programming language semantics". (1976, Chapman and Hall).

    Google Scholar 

  2. M. Raskovsky "Denotational Semantics as a Specification of Code Generator". (ACM-SIGPLAN Notices, 17, 6, June 1982).

    Google Scholar 

  3. V. Royer "Dérivation par réécriture d'une sémantique à pile congruente à une sémantique standard d'un language de programmation". Forthcoming internal report, January 1985.

    Google Scholar 

  4. J.E. Stoy "Denotational semantics: the Scott-Strachey approach to programming language theory". (MIT Press, 1977).

    Google Scholar 

  5. M. Wand "Deriving target code as a representation of continuation semantics". (AMC-TOPLAS, 4, 3, July 1982).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

K. Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Royer, V. (1984). Deriving stack semantics congruent to standard denotational semantics. In: Mehlhorn, K. (eds) STACS 85. STACS 1985. Lecture Notes in Computer Science, vol 182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024018

Download citation

  • DOI: https://doi.org/10.1007/BFb0024018

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13912-6

  • Online ISBN: 978-3-540-39136-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics