Programming language semantics in a typed lambda-calculus

  • Luigia Aiello
  • Mario Aiello
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 37)


Programming Language Procedure Activation Access Link Proof Checker Type Conflict 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 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. 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. 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. 5.
    Egli, H., Programming language semantics using extensional λ-calculus models. TR 74-206, Dept. of Computer Science, Cornell University, April 1974.Google Scholar
  6. 6.
    Hoare, C.A.R., An Axiomatic Basis for Computer Programming, Comm. ACM, 12, (1969) 576–580,583.Google Scholar
  7. 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. 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. 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. 10.
    Milner, R., Logic for computable functions, description of a machine implementation. Artificial Intelligence Memo n.169, Stanford University (1972).Google Scholar
  11. 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. 12.
    Scott, D.S. Continous Lattices, Proc. of 1971 Dalhousie Conf., Springer Lecture Notes Series, Springer-Verlag, Heidelberg (1971).Google Scholar
  13. 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. 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. 15.
    Wirth, N., The programming Language PASCAL, Acta Informatica, 1, (1971), 35–63.Google Scholar
  16. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Luigia Aiello
    • 1
  • Mario Aiello
    • 2
  1. 1.Istituto di Elaborazione dell'Informazione-CNRPisa
  2. 2.Istituto di Scienze dell'InformazioneUniversità di PisaItaly

Personalised recommendations