Skip to main content

Programming language semantics in a typed lambda-calculus

  • Conference paper
  • First Online:
λ-Calculus and Computer Science Theory (LCCST 1975)

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

Included in the following conference series:

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. Aiello, L. and Aiello, M., Proving Program Correctness in LCF, Presented at the Colloquium on Programming, Paris, 9–11 April 1974.

    Google Scholar 

  2. Aiello, L., Aiello, M. and Weyhrauch, R., W., The semantics of PASCAL in LCF, AI Memo n.221, Stanford University, August 1974.

    Google Scholar 

  3. Böhm, C., The CUCH as a formal and description language, in Formal language description languages for computer programming (T.B.Steel ed.) North Holland 1966.

    Google Scholar 

  4. Böhm, C. and Jacopini G., Flow diagrams, Turing machines and languages with only two formation rules. Comm.ACM, 9, (1966) 366–371.

    Google Scholar 

  5. Egli, H., Programming language semantics using extensional λ-calculus models. TR 74-206, Dept. of Computer Science, Cornell University, April 1974.

    Google Scholar 

  6. Hoare, C.A.R., An Axiomatic Basis for Computer Programming, Comm. ACM, 12, (1969) 576–580,583.

    Google Scholar 

  7. Hoare, C.A.R. and Wirth, N., An Axiomatic Definition of the Programming Language PASCAL, Acta Informatica, 2 (1973) 335–355.

    Google Scholar 

  8. Landin, P.J., A correspondence between ALGOL 60 and Church's lambda notation, Comm. ACM 8 (1965) 89–101,158–165.

    Google Scholar 

  9. Lucas, P. and Walk, K., On the Formal Description of PL/1, Ann.rev. in Automatic Programming, 6, Part 3 (1969).

    Google Scholar 

  10. Milner, R., Logic for computable functions, description of a machine implementation. Artificial Intelligence Memo n.169, Stanford University (1972).

    Google Scholar 

  11. Scott, D.S. and Strachey, C., Towards a Mathematical Semantics for Computer Languages, Proc. of the symposium on Computers and Automata, Microwave Research Institute Symposia Series, Vol. 12, Polytechnic Institute of Brooklyn (1971).

    Google Scholar 

  12. Scott, D.S. Continous Lattices, Proc. of 1971 Dalhousie Conf., Springer Lecture Notes Series, Springer-Verlag, Heidelberg (1971).

    Google Scholar 

  13. Strackey, C. Wadsworth C.P., Continuations, A Mathematical semantics for handling full jumps Oxford University Computing Laboratory Technival Manograph PRG-11 January 1974.

    Google Scholar 

  14. Tennent, R.D., Mathematical semantics and Design of programming languages. Ph.D. Thesis Dept of Computer Science, University of Toronto, Sept. 1973.

    Google Scholar 

  15. Wirth, N., The programming Language PASCAL, Acta Informatica, 1, (1971), 35–63.

    Google Scholar 

  16. Weyhrauch, R.W. and Milner R., Program Semantics and Correctness in a Mechanized Logic, Proc. 1st USA-Japan Computer Conf. Tokyo (1972).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

C. Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aiello, L., Aiello, M. (1975). Programming language semantics in a typed lambda-calculus. In: Böhm, C. (eds) λ-Calculus and Computer Science Theory. LCCST 1975. Lecture Notes in Computer Science, vol 37. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029529

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07416-8

  • Online ISBN: 978-3-540-37944-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics