Chapter PDF
References
APT, K.R. & J.W. DE BAKKER, Exercises in denotational semantics, in: Proc. 5th Symposium on Mathematical Foundations of Computer Science (A. Mazurkiewicz, ed.), pp. 1–11, Lecture Notes in Computer Science 45, Springer (1976).
BAKKER, J.W. DE, Least fixed points revisited, Theoretical Computer Science, 2, pp. 155–181 (1976).
BAKKER, J.W. DE, Correctness proofs for assignment statements, Report IW 55/76 Mathematisch Centrum (1976).
COOK, S.A., Axiomatic and interpretive semantics for an ALGOL fragment, Technical Report no. 79, University of Toronto (1975).
DONAHUE, J.E., Complementary definitions of programming language semantics, Lecture Notes in Computer Science 42, Springer (1976).
GORELICK, G.A., A complete axiomatic system for proving assertions about recursive and non-recursive programs, Technical Report no. 75, University of Toronto (1975).
HOARE, C.A.R., An axiomatic basis for programming language constructs, C.ACM 12, pp. 576–580 (1969).
HOARE, C.A.R., Procedures and parameters: an axiomatic approach, in: Symp. on Semantics or Algorithmic Languages, Lecture Notes in Mathematics 188 (E. Engeler, ed.) pp. 102–116, Springer (1971).
HOARE, C.A.R. & N. WIRTH, An axiomatic definition of the programming language PASCAL, Acta Inf. 2, pp. 335–355 (1973).
IGARASHI, S., R.L. LONDON & D.C. LUCKHAM, Axiomatic program verification I: A logical basis and its implementation, Acta Inf. 4, pp. 145–182 (1975).
LAUER, P.W., Consistent formal theories of the semantics of programming languages, Report TR 25 121, IBM Laboratory, Vienna (1971).
MANNA, Z. & J. VUILLEMIN, Fixpoint approach to the theory of the computation, C.ACM 15, pp. 528–536 (1972).
MILNE, R. & C. STRACHEY, A theory of programming language semantics, Chapman and Hall, London Wiley, New York (1976).
SCOTT, D. & J.W. DE BAKKER, A theory of programs, unpublished memo (1969).
SCOTT, D. & C. STRACHEY, Towards a mathematical semantics for computer languages, in: Proc. of the Symp. on Computers and Automata (J. Fox, ed.) pp. 19–46, Polytechnic Inst. of Brooklyn (1971).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Apt, K.R., de Bakker, J.W. (1977). Semantics and proof theory of pascal procedures. In: Salomaa, A., Steinby, M. (eds) Automata, Languages and Programming. ICALP 1977. Lecture Notes in Computer Science, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08342-1_3
Download citation
DOI: https://doi.org/10.1007/3-540-08342-1_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08342-9
Online ISBN: 978-3-540-37305-6
eBook Packages: Springer Book Archive