{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T06:23:56Z","timestamp":1780727036152,"version":"3.54.1"},"reference-count":160,"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]]},"DOI":"10.1137\/0205037","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T10:57:56Z","timestamp":1109242676000},"page":"522-587","source":"Crossref","is-referenced-by-count":564,"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","reference":[{"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":"R10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-5841-9_3"},{"key":"R12","volume-title":"Foundations of Computer Science","volume":"63","author":"de Bakker J. W.","year":"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":"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":"R28","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/12.1.41"},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-07142-3_71"},{"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":"crossref","DOI":"10.21236\/AD0757367","volume-title":"On the power of programming features","author":"Chandra A. K.","year":"1973"},{"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":"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":"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":"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":"crossref","DOI":"10.7146\/dpb.v4i47.6466","volume-title":"IO and OI","author":"Engelfreit J.","year":"1975"},{"key":"R66","first-page":"247","volume":"10","author":"Ershov JN. L.","year":"1971","journal-title":"Algebra and Logic"},{"key":"R67","first-page":"367","volume":"11","author":"Ershov JN. L.","year":"1972","journal-title":"Algebra and Logic"},{"key":"R68","first-page":"656","volume":"11","author":"Ershov JN. L.","year":"1972","journal-title":"Algebra and Logic"},{"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":"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":"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":"R84","volume-title":"Initial algebra semantics","author":"Goguen J. A.","year":"1975"},{"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":"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":"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":"R103","first-page":"235","volume":"2","author":"Hotz G\u00fcnter","year":"1966","journal-title":"Elektron. Informationsverarbeit. Kybernetik"},{"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":"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":"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":"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":"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":"crossref","DOI":"10.21236\/AD0406138","volume-title":"The LISP 1.5 Programmers' Manual","author":"Mccarthy J.","year":"1962"},{"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":"R150","doi-asserted-by":"crossref","DOI":"10.21236\/AD0758645","volume-title":"Models of LCF","author":"Milner R.","year":"1973"},{"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":"R156","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)71948-7"},{"key":"R159","volume-title":"Correctness of translations of programming languages","author":"Morris F. Lockwood","year":"1972"},{"key":"R161","doi-asserted-by":"publisher","DOI":"10.1145\/362588.362598"},{"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":"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":"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":"R184","volume-title":"A powerdomain construction","author":"Plotkin G. D.","year":"1975"},{"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":"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":"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":"R207","doi-asserted-by":"publisher","DOI":"10.2307\/2271892"},{"key":"R208","first-page":"388","volume":"38","author":"Sasso, Jr. Leonard P.","year":"1973","journal-title":"Proc. Amer. Math. Soc."},{"key":"R209","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90095-B"},{"key":"R215","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(09)70356-8"},{"key":"R217","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029517"},{"key":"R218","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029537"},{"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":"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":"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":"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":"R254","doi-asserted-by":"publisher","DOI":"10.2307\/2272736"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0205037","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T02:53:07Z","timestamp":1548730387000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/0205037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,9]]},"references-count":160,"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]]}}}