{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T12:25:13Z","timestamp":1769171113659,"version":"3.49.0"},"reference-count":38,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,5,1]],"date-time":"1982-05-01T00:00:00Z","timestamp":389059200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1982,5]]},"DOI":"10.1016\/0020-0190(82)90065-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"112-116","source":"Crossref","is-referenced-by-count":85,"title":["Fixed point theorems and semantics: a folk tale"],"prefix":"10.1016","volume":"14","author":[{"given":"J.-L.","family":"Lassez","sequence":"first","affiliation":[]},{"given":"V.L.","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"E.A.","family":"Sonenberg","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(82)90065-5_BIB1","doi-asserted-by":"crossref","first-page":"78","DOI":"10.4153\/CJM-1961-007-5","article-title":"A theorem on partially ordered sets with application to fixed point theorems","volume":"13","author":"Abian","year":"1961","journal-title":"Canad. J. Math."},{"key":"10.1016\/0020-0190(82)90065-5_BIB2","article-title":"A Cook's tour of countable non-determinism","author":"Apt","year":"1981","journal-title":"ICALP"},{"key":"10.1016\/0020-0190(82)90065-5_BIB3","series-title":"Mathematical Theory of Program Correctness","author":"de Bakker","year":"1980"},{"key":"10.1016\/0020-0190(82)90065-5_BIB4","series-title":"Programs and Machines","author":"Bird","year":"1976"},{"key":"10.1016\/0020-0190(82)90065-5_BIB5","volume":"Vol. 25","author":"Birkhoff","year":"1940"},{"key":"10.1016\/0020-0190(82)90065-5_BIB6","first-page":"434","article-title":"Sur le th\u00e9or\u00e8me de Zorn","author":"Bourbaki","year":"1950","journal-title":"Arch. Math."},{"key":"10.1016\/0020-0190(82)90065-5_BIB7","article-title":"Elements of mathematics","author":"Bourbaki","year":"1968","journal-title":"Theory of Sets"},{"key":"10.1016\/0020-0190(82)90065-5_BIB8","series-title":"A Programming Approach","article-title":"The Theory of Computer Science","author":"Brady","year":"1977"},{"key":"10.1016\/0020-0190(82)90065-5_BIB9","article-title":"Are fairness assumptions fair?","author":"Broy","year":"1981","journal-title":"2nd Internat. Conf. Distributed Computing Systems"},{"key":"10.1016\/0020-0190(82)90065-5_BIB10","series-title":"Ph.D. Thesis","article-title":"Recursive definitions of partial functions and their computations","author":"Cadiou","year":"1972"},{"key":"10.1016\/0020-0190(82)90065-5_BIB11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0315-0860(78)90136-2","article-title":"The origin of Zorn's lemma","volume":"5","author":"Campbell","year":"1978","journal-title":"Historia Math."},{"issue":"1","key":"10.1016\/0020-0190(82)90065-5_BIB12","doi-asserted-by":"crossref","DOI":"10.2140\/pjm.1979.82.43","article-title":"Constructive versions of Tarski's fixed point theorem","volume":"82","author":"Cousot","year":"1979","journal-title":"Pacific J. Math."},{"key":"10.1016\/0020-0190(82)90065-5_BIB13","series-title":"Reminiscences of Logicians, in Algebra and Logic","first-page":"1","volume":"450","year":"1975"},{"key":"10.1016\/0020-0190(82)90065-5_BIB14","series-title":"Computability, An Introduction to Recursive Function Theory","author":"Cutland","year":"1980"},{"key":"10.1016\/0020-0190(82)90065-5_BIB15","doi-asserted-by":"crossref","first-page":"147","DOI":"10.4064\/fm-53-2-147-154","article-title":"On monotonous mappings of complete lattices","volume":"53","author":"Devide","year":"1964","journal-title":"Fund. Math."},{"key":"10.1016\/0020-0190(82)90065-5_BIB16","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01744296","article-title":"On the existence of optimal fixpoints","volume":"13","author":"Gallier","year":"1980","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0020-0190(82)90065-5_BIB17","series-title":"A History of Numerical Analysis from the 16th through the 19th Century","author":"Goldstine","year":"1979"},{"issue":"7","key":"10.1016\/0020-0190(82)90065-5_BIB18","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1145\/358886.358892","article-title":"On folk theorems","volume":"23","author":"Harel","year":"1980","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(82)90065-5_BIB19","series-title":"Automata, Languages and Programming","article-title":"Induction rules and proofs of termination","author":"Hitchcock","year":"1972"},{"key":"10.1016\/0020-0190(82)90065-5_BIB20","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF02547750","article-title":"The method of successive approximations for functional equations","volume":"71","author":"Kantorovitch","year":"1939","journal-title":"Acta Math."},{"key":"10.1016\/0020-0190(82)90065-5_BIB21","first-page":"219","article-title":"On a class of functional equations","volume":"4","author":"Kantorovitch","year":"1946","journal-title":"Doklady URSS"},{"key":"10.1016\/0020-0190(82)90065-5_BIB22","series-title":"Introduction to Meta Mathematics","author":"Kleene","year":"1962"},{"key":"10.1016\/0020-0190(82)90065-5_BIB23","article-title":"The origins of recursive function theory, in 20th century","author":"Kleene","year":"1979","journal-title":"IEEE Foundations Comput. Sci."},{"key":"10.1016\/0020-0190(82)90065-5_BIB24","first-page":"133","article-title":"Un th\u00e9or\u00e8me sur les fonctions d'ensembles","volume":"6","author":"Knaster","year":"1928","journal-title":"Ann. Soc. Pol. Math."},{"key":"10.1016\/0020-0190(82)90065-5_BIB25","series-title":"Schemas, Preuves,Semantique","article-title":"Th\u00e9orie des Programmes","author":"Livercy","year":"1978"},{"key":"10.1016\/0020-0190(82)90065-5_BIB26","series-title":"Mathematical Theory of Computation","author":"Manna","year":"1974"},{"key":"10.1016\/0020-0190(82)90065-5_BIB27","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(78)90033-6","article-title":"The convergence of functions to fixed points of recursive definitions","volume":"6","author":"Manna","year":"1978","journal-title":"Theoretical Comput. Sci."},{"key":"10.1016\/0020-0190(82)90065-5_BIB28","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF02485815","article-title":"Chain-complete posets and directed sets with applications","volume":"6","author":"Markowsky","year":"1976","journal-title":"Algebra Universalis"},{"key":"10.1016\/0020-0190(82)90065-5_BIB29","series-title":"Theory of Programming Language Semantics","author":"Milne","year":"1976"},{"key":"10.1016\/0020-0190(82)90065-5_BIB30","first-page":"167","article-title":"Some fixed point theorems of the mappings of partially ordered sets","volume":"51","author":"Pasini","year":"1974","journal-title":"Rend. Sem. Math. Univ. Padova"},{"key":"10.1016\/0020-0190(82)90065-5_BIB31","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0020-0190(82)90065-5_BIB32","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","article-title":"Data types as lattices","volume":"5","author":"Scott","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(82)90065-5_BIB33","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BFb0059703","article-title":"The lattice of flow diagrams","volume":"188","author":"Scott","year":"1971","journal-title":"Springer Lecture Notes in Mathematics"},{"key":"10.1016\/0020-0190(82)90065-5_BIB34","series-title":"Proc. Symp. Computers and Automata","first-page":"19","article-title":"Toward a mathematical semantics for computer languages","author":"Scott","year":"1971"},{"key":"10.1016\/0020-0190(82)90065-5_BIB35","series-title":"Res. Rept. 132","article-title":"Fixed points of non-continuous functionals: Applications in programming language semantics","author":"Sonenberg","year":"1981"},{"key":"10.1016\/0020-0190(82)90065-5_BIB36","series-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory","author":"Stoy","year":"1977"},{"key":"10.1016\/0020-0190(82)90065-5_BIB37","first-page":"1051","article-title":"A fixed point theorem for lattices and its applications (preliminary version)","volume":"55","author":"Tarski","year":"1949","journal-title":"Bull. A.M.S."},{"key":"10.1016\/0020-0190(82)90065-5_BIB38","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice theoretical fixed point theorem and its applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019082900655?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019082900655?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:54:02Z","timestamp":1555088042000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019082900655"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,5]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,5]]}},"alternative-id":["0020019082900655"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(82)90065-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1982,5]]}}}