{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T14:22:20Z","timestamp":1791296540732,"version":"4.1.0"},"reference-count":254,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1976,9]]},"abstract":"<jats:p>The meaning of many kinds of expressions in programming languages can be taken as elements of certain spaces of \u201cpartial\u201d objects. In this report these spaces are modeled in one universal domain ${\\bf P} \\omega $, the set of all subsets of the integers. This domain renders the connection of this semantic theory with the ordinary theory of number theoretic (especially general recursive) functions clear and straightforward.<\/jats:p>","DOI":"10.1137\/0205037","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T05:57:56Z","timestamp":1109224676000},"page":"522-587","source":"Crossref","is-referenced-by-count":568,"title":["Data Types as Lattices"],"prefix":"10.1137","volume":"5","author":[{"given":"Dana","family":"Scott","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"L. Aiello, M. Aiello, R. W. Weyhrauch,  The semantics of PASCAL in LCF, Artificial Intelligence Lab. Memo., AIM-221, Stanford Univ., Stanford, Calif.,  1974","DOI":"10.21236\/AD0787631"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-07142-3_62"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-07142-3_64"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-07142-3_61"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-07142-3_59"},{"key":"R6","volume-title":"Recursive procedures","author":"de Bakker J. W.","year":"1971"},{"key":"R7","volume-title":"MC-25 Informatica Symposium (Amsterdam, 1972), Exp. No. 1","author":"de Bakker J. W.","year":"1971"},{"key":"R8","first-page":"167","volume-title":"Automata, languages and programming (Proc. Sympos., Rocquencourt, 1972)","author":"de Bakker J. W.","year":"1973"},{"key":"R9","unstructured":"J. W. de Bakker, D. Scott,  A theory of programs,  1969, Unpublished notes, IBM Seminar, Vienna, 1969"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-5841-9_3"},{"key":"R11","unstructured":"J. W. de Bakker, L. G. L. Meertens,  On the completeness of the inductive assertion method, Mathematical Centre Rep., IW 12\/72, Amsterdam,  1973"},{"key":"R12","volume-title":"Foundations of Computer Science","volume":"63","author":"de Bakker J. W.","year":"1974"},{"key":"R13","unstructured":"H. P. Barendregt, Ph.D. Thesis,  Some extensional term models forcombinatory logics and $\\lambda$-calculi, Univ. of Utrecht,  1971"},{"key":"R14","unstructured":"H. Beki\u0107,  Towards a mathematical theory of processes, Tech. Rep., TR 25.125, IBM Lab., Vienna,  1971"},{"key":"R15","unstructured":"H. Beki\u0107,  Definable operations in general algebra, and the theory of automata and flowcharts, Rep., IBM Lab., Vienna,  1969"},{"key":"R16","unstructured":"H. Beki\u0107etal,  A formal definition of a PL\/1 subset Parts I and II, Tech. Rep., TR 25.139, IBM Lab., Vienna,  1974"},{"key":"R17","unstructured":"R. S. Bird,  Unsolvability of the inclusion problem for DBS schemas, Rep., RCS22, Dept. of Computer Sci., Univ. of Reading,  1974"},{"key":"R18","volume-title":"Lattice theory","author":"Birkhoff Garrett","year":"1967"},{"key":"R19","volume":"85","author":"Blikle Andrzej","year":"1971","journal-title":"Dissertationes Math. Rozprawy Mat."},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(72)90063-0"},{"key":"R21","first-page":"17","volume-title":"Mathematical foundations of computer science (Proc. Sympos. and Summer School, Strbsk\u00e9 Pleso, 1973)","author":"Blikle Andrzej","year":"1973"},{"key":"R22","unstructured":"A. Blikle, A. Mazurkiewicz,  An algebraic approach to the theory of programs, algorithms, languages and recursiveness,  Proc. Internat. Sympos. and Summer School on the Mathematical Foundations of Computer Sci., Warsaw-Jablonna,  1972 0313.68022"},{"key":"R23","unstructured":"A. Blikle,  Proving programs by sets of computations,  Proc. 3rd Symp. on the Mathematical Foundation of Computer Sci., Jadwisin, Poland, Lecture Notes in Computer Science, Springer-Verlag, Berlin,  1974 0308.68027"},{"key":"R24","volume-title":"Alcune propriety Belle forme $\\beta$-$\\eta$-normal Nel $\\lambda$-$\\kappa$-calcolo","author":"B\u00f6hm C.","year":"1968"},{"key":"R25","first-page":"179","volume-title":"Formal Language Description Languages for Computer Programming","author":"B\u00f6hm C.","year":"1966"},{"key":"R26","doi-asserted-by":"crossref","unstructured":"C. B\u00f6hm,  $\\lambda$- Calculus and computer science theory,  Proc. Rome Symp., March 1975, Lecture Notes in Computer Science, Vol. 37, Springer-Verlag, Berlin,  1975","DOI":"10.1007\/BFb0029515"},{"key":"R27","unstructured":"R. M. Burstall,  B.  Meltzer, D.  Michie,  Some techniques for proving the correctness of programs which alter data structures,  Machine Intelligence vol. 7, Edinburgh,  1972a,  23\u201350 0259.68009"},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/12.1.41"},{"key":"R29","doi-asserted-by":"crossref","unstructured":"R. M. Burstall,  An algebraic description of programs with assertions, verification and simulation,  Proc. ACM Conf. on Proving Assertions about Programs, Las Cruces, New Mexico,  1972b,  7\u201314","DOI":"10.1145\/800235.807068"},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-07142-3_71"},{"key":"R31","doi-asserted-by":"crossref","unstructured":"J. M. Cadiou, Ph.D. Thesis,  Recursive definitions of partial functions and their computations, Computer Sci. Dept., Stanford Univ., Stanford, Calif.,  1973","DOI":"10.1145\/942580.807072"},{"key":"R32","doi-asserted-by":"crossref","unstructured":"J. M. Cadlou, J. J. L\u00e9vy,  Mechanizable proofs about parallel processes,  14th Annual IEEE Symposium on Switching and Automata Theory (Univ. Iowa, Iowa City, Iowa, 1973), IEEE Comput. Soc., Northridge, Calif.,  1973,  34\u201348 MR0438764 (55:11670)","DOI":"10.1109\/SWAT.1973.14"},{"key":"R33","doi-asserted-by":"publisher","DOI":"10.1016\/0003-4843(71)90003-9"},{"key":"R34","volume-title":"Topological spaces","author":"\u010cech Eduard","year":"1966"},{"key":"R35","volume-title":"Degrees of translatability and canonical forms in program schemas part 1","author":"Chandra A. K.","year":"1974"},{"key":"R36","volume-title":"The Power of Parallelism and Nondeterminism in Programming","author":"Chandra A. K.","year":"1974"},{"key":"R37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21545-6_43"},{"key":"R38","doi-asserted-by":"publisher","DOI":"10.21236\/AD0757367"},{"key":"R39","volume-title":"The calculi of lambda-conversion","author":"Church A.","year":"1951"},{"key":"R40","doi-asserted-by":"publisher","DOI":"10.1007\/BF00571463"},{"key":"R41","doi-asserted-by":"publisher","DOI":"10.1137\/0201006"},{"key":"R42","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/9.1.45"},{"key":"R43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21545-6_14"},{"key":"R44","volume-title":"Completude d'un systeme formel pour des equations recursives simples","author":"Courcelle B.","year":"1974"},{"key":"R45","doi-asserted-by":"crossref","unstructured":"B. Courcelle, J. Vuillemin,  Semantics and axiomatics of a simple recursive language,  Sixth Annual ACM Symposium on Theory of Computing (Seattle, Wash., 1974), Assoc. Comput. Mach., New York,  1974,  13\u201326, vol. 60 MR0416089 (54:4165)0358.68015","DOI":"10.1145\/800119.803880"},{"key":"R46","volume-title":"Combinatory logic. Vol. I","author":"Curry Haskell B.","year":"1958"},{"key":"R47","volume-title":"Combinatory Logic","author":"Curry H. B.","year":"1971"},{"key":"R48","volume-title":"Computability and unsolvability","author":"Davis Martin","year":"1958"},{"key":"R49","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(74)90008-0"},{"key":"R50","volume-title":"A discipline of programming","author":"Dijkstra Edsger W.","year":"1976"},{"key":"R51","volume-title":"Structural Programming","author":"Dijkstra E. W.","year":"1972"},{"key":"R52","volume-title":"Scottery Child's Guide No. 1","author":"Donahue J.","year":"1974"},{"key":"R53","unstructured":"B. N. Duong,  A high level, variable free calculus for recursive programming, Comput. Sci. Dept. Rep., CS 74 03, Univ. of Waterloo,  1974"},{"key":"R54","volume-title":"Recursiveness","author":"Eilenberg Samuel","year":"1970"},{"key":"R55","volume-title":"Automata, languages, and machines. Vol. A","author":"Eilenberg Samuel","year":"1974"},{"key":"R56","volume-title":"Automata, languages, and machines. Vol. B","author":"Eilenberg Samuel","year":"1976"},{"key":"R57","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0059694"},{"key":"R58","volume-title":"Abstract algorithms and diagram closure","author":"Elgot C. C.","year":"1967"},{"key":"R59","volume-title":"Multiple control computer models","author":"Elgot C. C.","year":"1966"},{"key":"R60","unstructured":"M. H. van Emden, R. A. Kowalski,  The semantics of predicate logic as a programming language, Memo., 83 (MIP-R-103), Dept. of Machine Intelligence, Univ. of Edinburgh,  1974"},{"key":"R61","volume-title":"Formal languages: Automata and structures","author":"Engeler Erwin","year":"1968"},{"key":"R62","volume-title":"AlgorithmicLogic, Foundations of ComputerScience","author":"Engeler E.","year":"1974"},{"key":"R63","doi-asserted-by":"publisher","DOI":"10.1007\/BF01705528"},{"key":"R64","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-06953-4"},{"key":"R65","doi-asserted-by":"publisher","DOI":"10.7146\/dpb.v4i47.6466"},{"key":"R66","doi-asserted-by":"publisher","DOI":"10.1007\/BF02219730"},{"key":"R67","doi-asserted-by":"publisher","DOI":"10.1007\/BF02219096"},{"key":"R68","doi-asserted-by":"publisher","DOI":"10.1007\/BF02284592"},{"key":"R69","first-page":"523","volume":"207","author":"Er\u0161ov Ju. L.","year":"1972","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"R70","first-page":"369","volume":"12","author":"Ershov JN. L.","year":"1972","journal-title":"Algebra and Logic"},{"key":"R71","doi-asserted-by":"crossref","DOI":"10.1002\/malq.19730191901","volume-title":"Theorie der Numerierungen. I","author":"Er\u0161ov Ju. L.","year":"1973"},{"key":"R72","doi-asserted-by":"crossref","unstructured":"A. E. Fischer, M. J. Fischer,  Mode modules as representations of domains,  Proc. ACM Symp. on Principles of Programming Languages, Boston,  1973,  139\u2013143 0309.68031","DOI":"10.1145\/512927.512940"},{"key":"R73","doi-asserted-by":"crossref","unstructured":"M. J. Fischer,  Lambda calculus schemata,  Proc. ACM Conf. Proving Assertions about Programs, Las Cruces, N.M.,  1972,  104\u2013109","DOI":"10.1145\/800235.807077"},{"key":"R74","doi-asserted-by":"publisher","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"R75","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-06859-7_136"},{"key":"R76","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19590050703"},{"key":"R77","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)71238-2"},{"key":"R78","doi-asserted-by":"crossref","unstructured":"S. J. Garland, D. C. Luckham,  Translating recursion schemes into program schemes,  Proc. ACM Conf. on Proving Assertions about Programs, Las Cruces, N.M.,  1972,  83\u201396","DOI":"10.1145\/800235.807075"},{"key":"R79","unstructured":"Helmuth Gericke, Lattice theory, Translated from the German, Frederick Ungar Publishing Co., New York, 1966, 185\u2013MR0219452 (36:2534)0199.04901"},{"key":"R80","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(67)90189-8"},{"key":"R81","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1969-12267-6"},{"key":"R82","doi-asserted-by":"crossref","unstructured":"J. A. Goguen,  On homomorphisms, simulations, correctness, subroutines and termination for programs and program schemes,  Proc. 13th IEEE Conf. on Switching and Automata Theory,  1972,  52\u201360","DOI":"10.1109\/SWAT.1972.10"},{"key":"R83","unstructured":"J. A. Goguen,  E.  Manes,  Semantics of computation,  Category Theory Applied to Computation and Control, Univ. of Mass.,  1974,  234\u2013249"},{"key":"R84","volume-title":"Initial algebra semantics","author":"Goguen J. A.","year":"1975"},{"key":"R85","unstructured":"M. J. C. Gordon,  Models of pure LISP, Experimental Programming Rep., 31, School of Artificial Intelligence, Univ. of Edinburgh,  1973a, (Also Ph.D. thesis, Evaluation and denotation of pure LISP programs: A worked example in semantics.)"},{"key":"R86","volume-title":"An extended abstract of \u201cModels of pure LISP\u201d","author":"Gordon M. J. C.","year":"1973"},{"key":"R87","volume-title":"Operational Reasoning and denotational semantics","author":"Gordon M. J. C.","year":"1975"},{"key":"R88","volume-title":"Towards a semantic theory of dynamic binding","author":"Gordon M. J. C.","year":"1975"},{"key":"R89","volume-title":"Universal algebra","author":"Gr\u00e4tzer George","year":"1968"},{"key":"R90","volume-title":"Sur une reduction des schemas de programmes polyadiques a des schemas monadiques et ses applications","author":"Guessarian I.","year":"1974"},{"key":"R91","unstructured":"L. Gutteridge, Masters Thesis,  Some Results on Enumeration Reducibility, Ph.D. dissertation, Simon Fraser Univ., Burnaby, B.C., Canada,  1971"},{"key":"R92","volume-title":"Introduction to combinatory logic","author":"Hindley J. R.","year":"1972"},{"key":"R93","volume-title":"Some remarks about the connections between combinatory logic and axiomatic recursion theory","author":"Hindley J. R.","year":"1975"},{"key":"R94","unstructured":"P. Hitchcock, Ph.D. Thesis,  An approach to formal reasoning about programs, Univ. of Warwick, England,  1974"},{"key":"R95","first-page":"225","volume-title":"Automata, languages and programming (Proc. Sympos., Rocquencourt, 1972)","author":"Hitchcock Peter","year":"1973"},{"key":"R96","doi-asserted-by":"publisher","DOI":"10.1145\/363235.363259"},{"key":"R97","doi-asserted-by":"publisher","DOI":"10.1145\/362452.362489"},{"key":"R98","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0059696"},{"key":"R99","volume-title":"Structured Programming","author":"Hoare C. A. R.","year":"1972"},{"key":"R100","first-page":"135","volume":"3","author":"Hoare C. A. R.","year":"1973","journal-title":"Acta Informat."},{"key":"R101","unstructured":"C. A. R. Hoare, N. Wirth,  An axiomatic definition of the programming language PASCAL, Bericht, Fachgr\u00fcppe Computer-Wissenschaften 6, Eidenossische Technische H\u00f6chschule, Z\u00fcrich,  1972"},{"key":"R102","unstructured":"C. Hosono, M. Sato,  A solution to Scott's problem: \u201cDo the retracts in $P\\omega$ form a continuous lattice?\u201d,  1975, Research Inst. for Mathematical Sci., Kyoto (preprint)"},{"key":"R103","first-page":"235","volume":"2","author":"Hotz G\u00fcnter","year":"1966","journal-title":"Elektron. Informationsverarbeit. Kybernetik"},{"key":"R104","unstructured":"J. M. E. Hyland, Ph.D. Thesis,  Recursion theory on the countable functionals, Oxford Univ., Oxford, England,  1975a"},{"key":"R105","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029520"},{"key":"R106","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-12.3.361"},{"key":"R107","volume-title":"The logical scheme of algorithms","author":"Ianov Y. I.","year":"1970"},{"key":"R108","volume-title":"Admissibility of fixed point induction in first order logic of typed theories","author":"Igarashi S.","year":"1972"},{"key":"R109","volume-title":"Gleichungsdefinierbarkeit in Relationalstukturen","author":"Indermark K.","year":"1974"},{"key":"R110","unstructured":"C. B. Jones,  Mathematical semantics of go to: Exit formulation and its relation to continuations,  1974, preprint"},{"key":"R111","unstructured":"G. Kahn,  A preliminary theory of parallel programs, Rapport, Laboria IRIA,  1973"},{"key":"R112","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(69)80027-9"},{"key":"R113","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(69)80011-5"},{"key":"R114","first-page":"253","volume-title":"Automata, languages and programming (Proc. Sympos., Rocquencourt, 1972)","author":"Kfoury D.","year":"1973"},{"key":"R115","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80030-9"},{"key":"R116","volume-title":"Introduction to Metamathematics","author":"Kleene S. C.","year":"1950"},{"key":"R117","first-page":"133","volume":"8","author":"Knaster B.","year":"1928","journal-title":"Ann. Soc. Polon. de Math."},{"key":"R118","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/6.4.308"},{"key":"R119","doi-asserted-by":"publisher","DOI":"10.1145\/363744.363749"},{"key":"R120","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-011356-2.50008-2"},{"key":"R121","doi-asserted-by":"publisher","DOI":"10.1145\/365230.365257"},{"key":"R122","first-page":"266","volume-title":"Formal Language Description Languages for Computer Programming","author":"Landin P. J.","year":"1966"},{"key":"R123","unstructured":"P. J. Landin,  B.  Meltzer, D.  Michie,  A program machine symmetric automata theory,  Machine Intelligence, 5, American Elsevier, New York,  1970,  99\u2013120 MR0261816 (41:6428)0216.56602"},{"key":"R124","unstructured":"R. M. Burstall, P. J. Landin,  Programs and their proofs: An algebraic approach,  Machine Intelligence, 4, American Elsevier, New York,  1969,  17\u201343 MR0250517 (40:3751)0215.55901"},{"key":"R125","first-page":"967","volume":"19","author":"Leszczy\u0142owski J.","year":"1971","journal-title":"Bull. Acad. Polon. Sci. S\u00e9r. Sci. Math. Astronom. Phys."},{"key":"R126","volume-title":"Recursively defined data types, Parts land II","author":"lewis C. H.","year":"1973"},{"key":"R127","volume-title":"An approach to abstraction computation structures","author":"Liskov B.","year":"1973"},{"key":"R128","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(70)80022-8"},{"key":"R129","volume-title":"Categories for the working mathematician","author":"MacLane Saunders","year":"1971"},{"key":"R130","unstructured":"E. Manes,  Category Theory Applied to Computation and Control,  Proc. 1st Internat. Symp. Math. Dept. and the Dept. of Computer and Information Sci., Univ. Mass., Amherst,  1974, Also: Lecture Notes in Computer Science, vol. 26, Springer-Verlag, New York 0293.00025"},{"key":"R131","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(69)80009-7"},{"key":"R132","volume-title":"Mathematical theory of computation","author":"Manna Zohar","year":"1974"},{"key":"R133","doi-asserted-by":"crossref","unstructured":"Z. Manna, J. M. Cadiou,  Recursive definitions of partial functions and their computations,  Proc. ACM Conf. on Proving Assertions about Programs, Las Cruces, N.M.,  1972,  58\u201365","DOI":"10.1145\/800235.807072"},{"key":"R134","unstructured":"Zohar Manna, John McCarthy,  B.  Meltzer, D.  Michie,  Properties of programs and partial function logic,  Machine Intelligence, 5, American Elsevier, New York,  1970,  27\u201337 MR0258627 (41:3273)0221.68016"},{"key":"R135","doi-asserted-by":"crossref","unstructured":"Z. Manna, Z. Ness, J. Vuillemin,  Inductive methods for proving properties of programs,  Proc. ACM Conf. on Proving Assertions about Programs, Las Cruces, N.M.,  1972,  27\u201350","DOI":"10.1145\/800235.807070"},{"key":"R136","doi-asserted-by":"publisher","DOI":"10.1145\/321592.321606"},{"key":"R137","volume-title":"Axiomatic approach to total correctness of programs","author":"Manna Z.","year":"1972"},{"key":"R138","doi-asserted-by":"publisher","DOI":"10.1145\/361454.361460"},{"key":"R139","volume-title":"Categories of chain-complete posers","author":"Markowsky G.","year":"1974"},{"key":"R140","volume-title":"Chain-complete posers and directed sets with applications","author":"Markowsky G.","year":"1974"},{"key":"R141","volume-title":"Proving properties of processes","author":"Mazurkiewicz A.","year":"1973"},{"key":"R142","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(71)90355-X"},{"key":"R143","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)72018-4"},{"key":"R144","doi-asserted-by":"publisher","DOI":"10.21236\/AD0406138"},{"key":"R145","unstructured":"J. Mccarthy,  C. M. Poppleworth,  Towards a mathematical science of computation,  Information Processing 1962, Proc. IFIP Congress 1962, North-Holland, Amsterdam,  1963b,  21\u201328"},{"key":"R146","first-page":"1","volume-title":"Formal Language Description Languages for Computer Programming","author":"Mccarthy J.","year":"1966"},{"key":"R147","doi-asserted-by":"publisher","DOI":"10.1090\/psapm\/019\/0242403"},{"key":"R148","unstructured":"R. E. Milne, Ph.D. Thesis,  The formal semantics of computer languages and their implementations, Cambridge Univ., Cambridge, England.,  1974, [Also: Technical Monograph PRG-13, Oxford Univ. Computing Lab., Programming Research Group]"},{"key":"R149","doi-asserted-by":"crossref","unstructured":"R. Milner,  Implementation and Application of Scott's Logic for Computable Functions,  Proc. ACM Conf., Las Cruces, N.M.,  1972,  1\u20136","DOI":"10.1145\/800235.807067"},{"key":"R150","doi-asserted-by":"publisher","DOI":"10.21236\/AD0758645"},{"key":"R151","unstructured":"R. Milner,  B.  Meltzer, D.  Michie,  Program schemes and recursive function theory,  Machine Intelligence, 5, American Elsevier, New York,  1970,  39\u201358 MR0319725 (47:8267)0221.68017"},{"key":"R152","volume-title":"Algebraic theory of computable polyadic functions","author":"Milner R.","year":"1970"},{"key":"R153","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(70)80021-6"},{"key":"R154","first-page":"51","volume":"7","author":"Milner R.","year":"1972","journal-title":"Machine Intelligence"},{"key":"R155","unstructured":"R. Milner,  An approach to the semantics of parallel programs,  Proc. Convgno di Informatics Teorica, Institute di Elaborazione Belle Informazione, Pisa, Italy,  1973a"},{"key":"R156","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)71948-7"},{"key":"R157","doi-asserted-by":"crossref","unstructured":"F. Lockwood Morris,  Advice on structuring compilers and proving them correct,  Proc. SIGACT\/SIGPLAN Symp. on Principles of Programming Languages, Boston,  1973,  144\u2013152","DOI":"10.1145\/512927.512941"},{"key":"R158","unstructured":"F. Lockwood Morris,  The next 700 programming language descriptions,  1970, Computer Center, Univ. of Essex (typescript)"},{"key":"R159","volume-title":"Correctness of translations of programming languages","author":"Morris F. Lockwood","year":"1972"},{"key":"R160","unstructured":"J. H. Morris, Ph.D. Thesis,  $\\lambda$-calculus models of programming languages, Sloan School of Management, Cambridge, Mass.,  1968, MIT MAC Reprint TR-57, Mass. Inst. of Tech."},{"key":"R161","doi-asserted-by":"publisher","DOI":"10.1145\/362588.362598"},{"key":"R162","doi-asserted-by":"crossref","unstructured":"J. H. Morris,  Types are not sets,  Proc. ACM Symp. on Principle of Programming Languages, Boston,  1973,  120\u2013124","DOI":"10.1145\/512927.512938"},{"key":"R163","unstructured":"J. H. Morris, Jr.,  R.  Rustin,  A correctness proof using recursively defined functions,  Formal semantics of programming languages (Courant Comput. Sci. Sympos. 2, New York Univ., New York, 1970), Englewood Cliffs, N.J.,  1972, 107\u2013124. Prentice Hall Series in Automat. Comput., Prentice-Hall MR0502148 (58:19305)"},{"key":"R164","volume-title":"Mechanical characterisation of the partial order in lattice models of $\\lambda$-calculus","author":"Morris J.","year":"1973"},{"key":"R165","volume-title":"The mathematical semantics of ALGOL 60","author":"Mosses P. D.","year":"1974"},{"key":"R166","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-07162-8_701"},{"key":"R167","unstructured":"P. D. Mosses, Masters Thesis,  Mathematical semantics and compiler generation, Thesis, Oxford Univ., Oxford, England,  1975b"},{"key":"R168","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19550010407"},{"key":"R169","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029519"},{"key":"R170","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-59-02637-7"},{"key":"R171","first-page":"293","volume-title":"Automata, languages and programming (Proc. Sympos., Rocquencourt, 1972)","author":"Nivat M.","year":"1973"},{"key":"R172","volume-title":"On logic and program verification","author":"Oppen D. C.","year":"1975"},{"key":"R173","unstructured":"David Park,  B.  Meltzer, D.  Michie,  Fixpoint induction and proofs of program properties,  Machine intelligence, 5, American Elsevier, New York,  1970,  59\u201378 MR0323149 (48:1507)"},{"key":"R174","unstructured":"D. M. R. Park,  Notes on a formalism for reasoning about schemes,  1970b, Univ. of Warwick, unpublished notes"},{"key":"R175","unstructured":"D. M. R. Park,  The\n                      Y\n                      combinator Scott's lambda-calculus models,  1970c, Univ. of Warwick, unpublished notes"},{"key":"R176","volume-title":"Finileness is Mu-ineffable","author":"Park D. M. R.","year":"1970"},{"key":"R177","first-page":"19","volume-title":"Machine Intelligence","volume":"3","author":"Paterson M. S.","year":"1963"},{"key":"R178","unstructured":"M. S. Paterson, C. S. HeWitt,  Comparative schematology,  Record of Project MAC Conf. on Concurrent Systems and Parallel Computation, Association for Computing Machinery, New York,  1970, 119ff"},{"key":"R179","unstructured":"R. Platek,  New foundations for recursion theory,  1964, Thesis, Stanford Univ., Stanford, Calif., unpublished"},{"key":"R180","unstructured":"G. D. Plotkin,  A set-theoretical definition of application, Memo., MIP-R-95, School of Artificial Intelligence, University of Edinburgh,  1972"},{"key":"R181","unstructured":"G. D. Plotkin,  The $\\lambda$-calculus is $\\omega$-incomplete, Res. Memo., SAI-RM-2, School of Artificial Intelli-gence, Univ. of Edinburgh,  1973a"},{"key":"R182","unstructured":"G. D. Plotkin,  Lambda-definability and logical relations, Memo., SAI-RM-4, School of Artificial Intelligence, Univ. of Edinburgh,  1973b"},{"key":"R183","unstructured":"G. D. Plotkin,  Call by name, Call-by-value and the $\\lambda$-calculus, I, Res. Memo., SAI-RM-6, School of Artificial Intelligence, Univ. of Edinburgh,  1973c"},{"key":"R184","volume-title":"A powerdomain construction","author":"Plotkin G. D.","year":"1975"},{"key":"R185","unstructured":"H. Rasiowa,  On $\\omega^{+}$-valued algorithmic logic and related problems,   Supplement to Proc. Symp. and Summer School on Mathematical Foundations of Computer Sci., High Tatras, Czechoslovakia,  1973"},{"key":"R186","unstructured":"P. Raulefs,  The overtyped lambda calculus, Interner Bericht, 2, Institut f\u00fcr Informatik, Universit\u00e4t Karlsruhe,  1975a"},{"key":"R187","unstructured":"P. Raulefs,  Standard models of the overtyped lambda-calculus, Interner Bericht, 3, Institut f\u00fcr Informatik, Universitat Karlsruhe,  1975b"},{"key":"R188","volume-title":"The theory of general events and its application to parallel programming","author":"Rediejowski R. R.","year":"1972"},{"key":"R189","volume-title":"Gedanken: A Simple Typeless Language","author":"Reynolds J. C.","year":"1969"},{"key":"R190","doi-asserted-by":"crossref","unstructured":"J. C. Reynolds,  Definitional interpreters for higher order programming languages,  Proc. ACM 25th Nat. Conf., Vol. 2, Boston,  1972a,  717\u2013740","DOI":"10.1145\/800194.805852"},{"key":"R191","volume-title":"Notes on a lattice-theoretic approach to the theory of computation","author":"Reynolds J. C.","year":"1972"},{"key":"R192","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-06859-7_148"},{"key":"R193","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-06841-4_57"},{"key":"R194","unstructured":"J. C. Reynolds,  Semantics of the lattice of flow diagrams,  1974b, Systems and Information Science Dept., Syracuse Univ., Syracuse, N.Y. (preprint)"},{"key":"R195","first-page":"123","volume-title":"Symposia Mathematica, Vol. XV (Convegno di Informatica Teorica, INDAM, Roma, 1973)","author":"Reynolds John C.","year":"1975"},{"key":"R196","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21545-6_4"},{"key":"R197","volume-title":"Operational, mathematical and axiomatized semantics for recursive procedures and data structures","author":"de Roever W. P.","year":"1974"},{"key":"R198","volume-title":"Theory of recursive functions and effective computability","author":"Rogers, Jr. Hartley","year":"1967"},{"key":"R199","doi-asserted-by":"publisher","DOI":"10.1145\/321738.321750"},{"key":"R200","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80034-0"},{"key":"R201","volume-title":"Parallel processes ... Schemata and transformation","author":"Rutledge J. D.","year":"1970"},{"key":"R202","first-page":"227","volume":"18","author":"Salwicki A.","year":"1970","journal-title":"Bull. Acad. Polon. Sci. S\u00e9r. Sci. Math. Astronom. Phys."},{"key":"R203","first-page":"275","volume":"18","author":"Salwicki A.","year":"1970","journal-title":"Bull. Acad. Polon. Sci. S\u00e9r. Sci. Math. Astronom. Phys."},{"key":"R204","first-page":"279","volume":"18","author":"Salwicki A.","year":"1970","journal-title":"Bull. Acad. Polon. Sci. S\u00e9r. Sci. Math. Astronom. Phys."},{"key":"R205","volume-title":"The lambda calculus, lattice theory and reflexive domains","author":"Sanderson J. G.","year":"1973"},{"key":"R206","unstructured":"L. P. Sasso, Masters Thesis,  Degrees of unsolvability of partial functions, Ph.D. dissertation, Univ. of Calif., Berkeley,  1971"},{"key":"R207","doi-asserted-by":"publisher","DOI":"10.2307\/2271892"},{"key":"R208","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1973-0311467-5"},{"key":"R209","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90095-B"},{"key":"R210","unstructured":"D. Scott,  Outline of a mathematical theory of computation,  Proc. 4th Ann. Princeton Conf. on Information Sciences and Systems,  1970,  169\u2013176, [Also: Tech. Monograph PRG-2, Oxford Univ. Computing Lab., Programming Research Group (1970).]"},{"key":"R211","unstructured":"D. Scott,  E.  Engeler,  The lattice of flow diagrams,  Symposium on Semantics of Algorithmic Languages, Lecture Notes in Mathematics, Vol. 188, Springer-Verlag, New York,  1971,  311\u2013366, [Also: Tech. Monograph PRG-3, Oxford Univ. Computing Lab., Programming Research Group (1970)]"},{"key":"R212","doi-asserted-by":"crossref","unstructured":"D. Scott,  Continuous lattices,  Proc.1971 Dalhousie Conference, Lecture Notes in Mathematics, Vol. 274, Springer-Verlag, New York,  1972a,  97\u2013136, [Also: Tech. Monograph PRG-7, Oxford Univ. Computing Lab., Programming Research Group (1971).]","DOI":"10.1007\/BFb0073967"},{"key":"R213","unstructured":"D. Scott,  Mathematical concepts in programming language semantics,  AFIPS Conf. Proc., Vol. 40,  1972b,  225\u2013234"},{"key":"R214","unstructured":"D. Scott,  Data types as lattices,  1973a, Unpublished lecture notes, Mathematical Centre, Amsterdam, 1973"},{"key":"R215","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(09)70356-8"},{"key":"R216","doi-asserted-by":"crossref","unstructured":"D. Scott,  Stig  Kanger,  Lambda calculus and recursion theory,  Proc. 3rd Scandinavian Logic Symposium, North-Holland, Amsterdam,  1975a,  154\u2013193","DOI":"10.1016\/S0049-237X(08)70730-4"},{"key":"R217","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029517"},{"key":"R218","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029537"},{"key":"R219","unstructured":"D. Scott, C. Strachey,  Toward a mathematical semantics for computer languages,  Proc. Symposium on Computers and Automata, Vol. 21, Polytechnic Inst. of Brooklyn,  1971,  19\u201346, [Also: Technical Monograph PRG-6, Oxford Univ. Computing Lab., Programming Research Group (1971).]"},{"key":"R220","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)71963-3"},{"key":"R221","first-page":"198","volume-title":"Formal Language Description Languages for Computer Programming","author":"Strachey C.","year":"1966"},{"key":"R222","unstructured":"C. Strachey,  Fundamental concepts in programming languages,  1967, Unpublished lecture notes for the NATO Summer School, Copenhagen"},{"key":"R223","unstructured":"C. Strachey,  Varieties of programming languages,  Proc. Internat. Computing Symp., Cini Foundation, Venice,  1972,  222\u2013233, [Also: Tech. Monograph PRG-10, Oxford Univ. Computing Lab., Programming Research Group (1972).]"},{"key":"R224","unstructured":"C. Strachey, C. Wadsworth,  Continuations: A mathematical semantics for handling full jumps, Tech. Monograph PRG-11, Oxford Univ. Computing Lab., Programming Research Group,  1974"},{"key":"R225","unstructured":"A. Tang, Ph.D. Thesis,  Recursion theory and descriptive set theory in effectively given $T_0$ spaces, Princeton Univ., Princeton, N.J.,  1974"},{"key":"R226","unstructured":"A. Tang,  Borel sets in $P\\omega$,  1975a, IRIA-Laboria, preprint"},{"key":"R227","unstructured":"A. Tang,  Notes on subsets on $P\\omega$ with extra -finitary property,  1975b, IRIA, preprint"},{"key":"R228","unstructured":"A. Tang,  Sets of the form ${x|R(x)=T}$ in $P\\omega$,  1975c, IRIA, preprint"},{"key":"R229","unstructured":"A. Tang,  $\\leqq$ Degrees in\n                      P\n                      ,  1975d, IRIA, preprint"},{"key":"R230","unstructured":"A. Tang,  A hierarchy of $B_\\delta$ sets in\n                      P\n                      ,  1975e, IRIA, preprint"},{"key":"R231","volume-title":"Logic, semantics, metamathematics","author":"Tarski Alfred","year":"1983"},{"key":"R232","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1955.5.285"},{"key":"R233","unstructured":"R. D. Tennent, Ph.D. Thesis,  Mathematical semantics and design of programming languages, Univ. of Toronto,  1973, [Also: Tech. Rep. 59, Univ. of Toronto (1973).]"},{"key":"R234","unstructured":"R. D. Tennent,  The mathematical semantics of programming languages,  1974a, Dept. of Computing and Information Sci., Queen's Univ., Kingston, Ontario, Canada (preprint)"},{"key":"R235","unstructured":"R. D. Tennent,  A contribution to the development of PASCAL-like languages, Tech. Rep., 74-25, Dept. of Computing and Information Sci., Queen's Univ., Kingston, Ontario, Canada,  1974b"},{"key":"R236","unstructured":"R. D. Tennent,  PASQUAL: A proposed generalization of PASCAL, Tech. Rep., 75-32, Dept. of Computing and Information Sci., Queen's Univ., Kingston, Ontario, Canada,  1975"},{"key":"R237","unstructured":"J. Vuillemin,  Proof techniques for recursive programs, Laboria Rep, IRIA,  1973a"},{"key":"R238","doi-asserted-by":"crossref","unstructured":"J. Vuillemin,  Correct and optimal implementations of recursion in a simple programming language, Laboria Rep., 24, IRIA,  1973b","DOI":"10.1145\/800125.804054"},{"key":"R239","unstructured":"C. P. Wadsworth, Ph.D. Thesis,  Semantics and pragmatices of the lambda-calculus, Oxford Univ., Oxford, England,  1971"},{"key":"R240","unstructured":"C. P. Wadsworth,  The relation between lambda-expressions and their denotation,  1975a, Dept. of Systems and Information Sci., Syracuse Univ., Syracuse, N.Y. (preprint)"},{"key":"R241","volume-title":"Approximate reduction and lambda-calculus models","author":"Wadsworth C. P.","year":"1975"},{"key":"R242","first-page":"215","volume-title":"To H. B. Curry: essays on combinatory logic, lambda calculus and formalism","author":"Wadsworth Christopher P.","year":"1980"},{"key":"R243","unstructured":"C. P. Wadsworth,  On the topological ordering in the D-model of the lambda-calculus, (to apper) in preparation"},{"key":"R244","doi-asserted-by":"crossref","unstructured":"E. G. Wagner,  Languages for defining sets in arbitrary algebras,  Proc. of the 11th IEEE Conf. on Switching and Automata Theory,  1971a,  192\u2013201","DOI":"10.1109\/SWAT.1971.16"},{"key":"R245","doi-asserted-by":"crossref","unstructured":"E. G. Wagner,  An algebraic theory of recursive definitions and recursive languages,  Proc. of the 3rd ACM Symp. on Theory of Computing,  1971b","DOI":"10.1145\/800157.805034"},{"key":"R246","unstructured":"E. G. Wagner,  Notes on categories, algebras and programming languages,  1974, Unpublished lecture notes, London"},{"key":"R247","unstructured":"Wand,  Mathematical foundations of formal language theory, MAC-TR-108, Project MAC, Mass. Inst. of Tech., Cambridge, Mass.,  1973"},{"key":"R248","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-07142-3_84"},{"key":"R249","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-07142-3_85"},{"key":"R250","volume-title":"Realizing data structures as lattices","author":"Wand M.","year":"1974"},{"key":"R251","volume-title":"Fixed-point constructions in order-enriched categories","author":"Wand M.","year":"1975"},{"key":"R252","unstructured":"P. Wegner, D. Lehmann,  Algebraic and topological prerequisites to Scott's theory of computation, Tech. Rep., 72-2, Dept. of Computer Sci., Hebrew Univ. of Jerusalem,  1972"},{"key":"R253","unstructured":"R. W. Weyrauch, R. Milner,  Program correctness in a mechanized logic,  Proc. of the 1st USA-JAPAN Computer Conf.,  1972,  384\u2013390"},{"key":"R254","doi-asserted-by":"publisher","DOI":"10.2307\/2272736"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0205037","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:34:26Z","timestamp":1787337266000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0205037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,9]]},"references-count":254,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1976,9]]}},"alternative-id":["10.1137\/0205037"],"URL":"https:\/\/doi.org\/10.1137\/0205037","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1976,9]]}}}