{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:53Z","timestamp":1725457013348},"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\/bfb0029528","type":"book-chapter","created":{"date-parts":[[2005,12,6]],"date-time":"2005-12-06T14:42:57Z","timestamp":1133880177000},"page":"220-239","source":"Crossref","is-referenced-by-count":1,"title":["Typed meaning in Scott's \u03bb-calculus models"],"prefix":"10.1007","author":[{"given":"Herbert","family":"Egli","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Constable, R.L. and Egli, H., \u201cComputability on Continuous Higher Types and its role in the semantics of programming languages\u201d, TR 74-209, Computer Science Department, Cornell University (1974)."},{"key":"13_CR2","unstructured":"Egli, H., \u201cAn Analysis of Scott's \u03bb-Calculus Models\u201d, TR 73-191, Computer Science Department. Cornell University (1973)."},{"key":"13_CR3","unstructured":"Egli, H., \u201cProgramming Language Semantics using Extensional \u03bb-Calculus Models\u201d, TR 74-206, Computer Science Department, Cornell University (1974)."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Milner, R., \u201cLogic for Computable Functions, Description of a Machine Implementation\u201d, AIM-169\/CS-288, Computer Science Department, Stanford University (1972).","DOI":"10.21236\/AD0785072"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Milner, R., \u201cImplementation and Applications of Scott's Logic for Computable Functions\u201d, Proc. of an ACM Conference on Proving Assertions about Programs, Las Cruces, New Mexico (1972).","DOI":"10.1145\/800235.807067"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Milner, R., \u201cModels of LCF\u201d, AIM-186\/CS-332, Computer Science Department, Stanford University (1973).","DOI":"10.21236\/AD0758645"},{"key":"13_CR7","unstructured":"Milner, R. and Weyhrauch, R., \u201cProving Compiler Correctness in a Mechanized Logic\u201d, Machine Intelligence 7, ed. D. Michie, Edinburgh University Press (1972)."},{"key":"13_CR8","unstructured":"Reynolds, J.C., \u201cNotes on a Lattice-Theoretic Approach to the Theory of Computation\u201d, Systems and Information Science, Syracuse University (1972)."},{"key":"13_CR9","unstructured":"Scott, P., \u201cOutline of a Mathematical Theory of Computation\u201d, Oxford University Computing Laboratory, Technical Monograph PRG-2 (1970)."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Scott, D., \u201cContinuous Lattices\u201d, Proc. Dalhousie Conference on Toposes, Algebraic Geometry and Logic, Springer Lecture Notes in Mathematics # 274, (1972).","DOI":"10.1007\/BFb0073967"},{"key":"13_CR11","volume-title":"Toward a Mathematical Semantics for Computer Languages","author":"P. Scott","year":"1971","unstructured":"Scott, P. and Strachey, C., \u201cToward a Mathematical Semantics for Computer Languages\u201d, Proc. of a Symposium on Computer and Automata, New York, Polytechnic Institute of Brooklyn (1971)."},{"key":"13_CR12","unstructured":"Strachey, C. and Wadsworth, C.P., \u201cContinuations. A Mathematical Semantics for Handling Full Jumps\u201d, Oxford University Computing Laboratory, Technical Monograph PRG-11 (1974)."},{"key":"13_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-010-2913-1","volume-title":"Combinators, \u03bb-Terms and Proof Theory","author":"S. Stenlund","year":"1972","unstructured":"Stenlund, S., \u201cCombinators, \u03bb-Terms and Proof Theory\u201d, D. Reidel Publishing Company\/Dordrecht-Holland (1972)."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Tennent, R.D., \u201cMathematical Semantics and Design of Programming Languages\u201d, Ph.D. Thesis, Department of Computer Science, University of Toronto (Sept. 1973).","DOI":"10.1145\/512927.512936"},{"key":"13_CR15","unstructured":"Vuillemin, J., \u201cProof Techniques for Recursive Programs\u201d, Ph.D. Thesis, Computer Science Department, Stanford University (1973)."},{"key":"13_CR16","unstructured":"Wadsworth, C.P., \u201cSemantics and Pragmatics of the Lambda-Calculus\u201d, Ph.D. Thesis, University of Oxford (1971)."}],"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\/BFb0029528","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T11:16:39Z","timestamp":1586603799000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029528"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540074163"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0029528","relation":{},"subject":[]}}