Abstract
In the last few years increasing use has been made of structural operational semantics to study aspects of programming languages which traditionally have been analysed via denotational semantics. (The articles in the recent collection by Gordon and Pitts (1998) are a good illustration of this development and its applications.) Since there are more or less adequate denotational models for programming language features such as higher order functions and procedures, recursive definitions, local state, and data abstraction, one might wonder why one should consider syntactic methods at all. This tutorial talk will attempt to explain why one should.
This is a preview of subscription content, log in via an institution.
References
Berry, G. and G. Boudol (1992). The chemical abstract machine. Theoretical Computer Science 96.
Birkedal, L. and R. Harper (1997). Relational interpretation of recursive types in an operational setting (Summary). In M. Abadi and T. Ito (Eds.), Theoretical Aspects of Computer Software, 3rd Int. Symp., Volume 1281 of Lecture Notes in Computer Science. Springer-Verlag, Berlin.
Felleisen, M. and R. Hieb (1992). The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science 103, 235–271.
Gordon, A. D. and A. M. Pitts (Eds.) (1998). Higher Order Operational Techniques in Semantics. Publications of the Newton Institute. Cambridge University Press.
Harper, R. and C. Stone (1996). A type-theoretic account of Standard ML 1996 (version 2). Technical Report CMU-CS-96-136R, Carnegie Mellon University, Pittsburgh, PA.
Hoare, C. A. R. (1996). Algebra and models. In I. Wand and R. Milner (Eds.), Computing Tomorrow. Future research directions in computer science, Chapter 9, pp. 158–187. Cambridge University Press.
Mason, I. A., S. F. Smith, and C. L. Talcott (1996). From operational semantics to domain theory. Information and Computation 128(1), 26–47.
Milner, R. (1990). Functions as processes. In Proc. 17th Int. Coll. on Automata, Languages and Programming, Volume 443 of Lecture Notes in Computer Science, pp. 167–180. Springer-Verlag, Berlin.
Pitts, A. M. (1997). Reasoning about local variables with operationally-based logical relations. In P. W. O'Hearn and R. D. Tennent (Eds.), Algol-Like Languages, Volume 2, Chapter 17, pp. 173–193. Birkhauser.
Pitts, A. M. (1998). Existential types:logical relations and operational equivalence. In Proceedings ICALP'98, Lecture Notes in Computer Science, Springer-Verlag, Berlin.
Pitts, A. M. and I. D. B. Stark (1998). Operational reasoning for functions with local state. In (Gordon and Pitts, 1998).
Smith, S. F. (1998). The coverage of operational semantics. In (Gordon and Pitts, 1998).
Wright, A. K. and M. Felleisen (1994). A syntactic approach to type soundness. Information and computation 115, 38–94.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pitts, A.M. (1998). Operational versus denotational methods in the semantics of higher order languages. In: Palamidessi, C., Glaser, H., Meinke, K. (eds) Principles of Declarative Programming. ALP PLILP 1998 1998. Lecture Notes in Computer Science, vol 1490. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056620
Download citation
DOI: https://doi.org/10.1007/BFb0056620
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65012-6
Online ISBN: 978-3-540-49766-0
eBook Packages: Springer Book Archive