{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:49Z","timestamp":1725457009616},"publisher-location":"Berlin\/Heidelberg","reference-count":16,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540074163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029529","type":"book-chapter","created":{"date-parts":[[2005,12,6]],"date-time":"2005-12-06T09:42:57Z","timestamp":1133862177000},"page":"240-251","source":"Crossref","is-referenced-by-count":1,"title":["Programming language semantics in a typed lambda-calculus"],"prefix":"10.1007","author":[{"given":"Luigia","family":"Aiello","sequence":"first","affiliation":[]},{"given":"Mario","family":"Aiello","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Aiello, L. and Aiello, M., Proving Program Correctness in LCF, Presented at the Colloquium on Programming, Paris, 9\u201311 April 1974.","DOI":"10.1007\/3-540-06859-7_124"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Aiello, L., Aiello, M. and Weyhrauch, R., W., The semantics of PASCAL in LCF, AI Memo n.221, Stanford University, August 1974.","DOI":"10.21236\/AD0787631"},{"key":"14_CR3","unstructured":"B\u00f6hm, C., The CUCH as a formal and description language, in Formal language description languages for computer programming (T.B.Steel ed.) North Holland 1966."},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1145\/355592.365646","volume":"9","author":"C. B\u00f6hm","year":"1966","unstructured":"B\u00f6hm, C. and Jacopini G., Flow diagrams, Turing machines and languages with only two formation rules. Comm.ACM, 9, (1966) 366\u2013371.","journal-title":"Comm.ACM"},{"key":"14_CR5","unstructured":"Egli, H., Programming language semantics using extensional \u03bb-calculus models. TR 74-206, Dept. of Computer Science, Cornell University, April 1974."},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C.A.R. Hoare","year":"1969","unstructured":"Hoare, C.A.R., An Axiomatic Basis for Computer Programming, Comm. ACM, 12, (1969) 576\u2013580,583.","journal-title":"Comm. ACM"},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF00289504","volume":"2","author":"C.A.R. Hoare","year":"1973","unstructured":"Hoare, C.A.R. and Wirth, N., An Axiomatic Definition of the Programming Language PASCAL, Acta Informatica, 2 (1973) 335\u2013355.","journal-title":"Acta Informatica"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/363744.363749","volume":"8","author":"P.J. Landin","year":"1965","unstructured":"Landin, P.J., A correspondence between ALGOL 60 and Church's lambda notation, Comm. ACM 8 (1965) 89\u2013101,158\u2013165.","journal-title":"Comm. ACM"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Lucas, P. and Walk, K., On the Formal Description of PL\/1, Ann.rev. in Automatic Programming, 6, Part 3 (1969).","DOI":"10.1016\/0066-4138(69)90005-6"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Milner, R., Logic for computable functions, description of a machine implementation. Artificial Intelligence Memo n.169, Stanford University (1972).","DOI":"10.21236\/AD0785072"},{"key":"14_CR11","unstructured":"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)."},{"key":"14_CR12","series-title":"Springer Lecture Notes Series","volume-title":"Proc. of 1971 Dalhousie Conf.","author":"D.S. Scott","year":"1971","unstructured":"Scott, D.S. Continous Lattices, Proc. of 1971 Dalhousie Conf., Springer Lecture Notes Series, Springer-Verlag, Heidelberg (1971)."},{"key":"14_CR13","unstructured":"Strackey, C. Wadsworth C.P., Continuations, A Mathematical semantics for handling full jumps Oxford University Computing Laboratory Technival Manograph PRG-11 January 1974."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Tennent, R.D., Mathematical semantics and Design of programming languages. Ph.D. Thesis Dept of Computer Science, University of Toronto, Sept. 1973.","DOI":"10.1145\/512927.512936"},{"key":"14_CR15","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF00264291","volume":"1","author":"N. Wirth","year":"1971","unstructured":"Wirth, N., The programming Language PASCAL, Acta Informatica, 1, (1971), 35\u201363.","journal-title":"Acta Informatica"},{"key":"14_CR16","unstructured":"Weyhrauch, R.W. and Milner R., Program Semantics and Correctness in a Mechanized Logic, Proc. 1st USA-Japan Computer Conf. Tokyo (1972)."}],"container-title":["Lecture Notes in Computer Science","\u03bb-Calculus and Computer Science Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029529","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T07:16:33Z","timestamp":1586589393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540074163"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0029529","relation":{},"subject":[]}}