{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T08:34:10Z","timestamp":1770280450280,"version":"3.49.0"},"reference-count":90,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8174,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1016\/0168-0072(91)90065-t","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T21:32:03Z","timestamp":1034285523000},"page":"1-77","source":"Crossref","is-referenced-by-count":296,"title":["Domain theory in logical form*"],"prefix":"10.1016","volume":"51","author":[{"given":"Samson","family":"Abramsky","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(91)90065-T_bib1","series-title":"Automata, Languages and Programming","first-page":"1","article-title":"Semantic foundations for applicative multiprogramming","volume":"154","author":"Abramsky","year":"1983"},{"key":"10.1016\/0168-0072(91)90065-T_bib2","series-title":"Ph.D. Thesis","article-title":"Domain theory and the logic of observable properties","author":"Abramsky","year":"1987"},{"key":"10.1016\/0168-0072(91)90065-T_SB0015","doi-asserted-by":"crossref","DOI":"10.1006\/inco.1991.9999","article-title":"A domain equation for bisimulation","author":"Abramsky","year":"1991","journal-title":"Information and Computation"},{"key":"10.1016\/0168-0072(91)90065-T_SB0020","series-title":"Ph.D. Thesis","article-title":"Domain theory and the logic of observable properties","author":"Abramsky","year":"1987"},{"key":"10.1016\/0168-0072(91)90065-T_bib4","series-title":"Symp. on Logic in Computer Science","first-page":"47","article-title":"Domain theory in logical form","author":"Abramsky","year":"1987"},{"key":"10.1016\/0168-0072(91)90065-T_SB0030","series-title":"Research Topics in Functional Programming","first-page":"65","article-title":"The lazy \u03bb-calculus","author":"Abramsky","year":"1990"},{"key":"10.1016\/0168-0072(91)90065-T_SB0035","series-title":"Ph.D. Thesis","article-title":"Domain theory and the logix of observable properties","author":"Abramsky","year":"1987"},{"key":"10.1016\/0168-0072(91)90065-T_bib6","unstructured":"S. Abramsky, Total vs. partial objects in denotational semantics, to appear."},{"key":"10.1016\/0168-0072(91)90065-T_bib7","series-title":"Abstract Interpretation for Declarative Languages","year":"1987"},{"key":"10.1016\/0168-0072(91)90065-T_bib8","article-title":"An introduction to inductive definitions","volume":"90","author":"Aczel","year":"1977"},{"key":"10.1016\/0168-0072(91)90065-T_bib9","article-title":"The Lambda Calculus: Its Syntax and Semantics","volume":"103","author":"Barendregt","year":"1984"},{"key":"10.1016\/0168-0072(91)90065-T_bib10","doi-asserted-by":"crossref","first-page":"931","DOI":"10.2307\/2273659","article-title":"A filter lambda model and the completeness of type-assignment","volume":"48","author":"Barendregt","year":"1983","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(91)90065-T_bib11","series-title":"Toposes, Triples and Theories","author":"Barr","year":"1984"},{"key":"10.1016\/0168-0072(91)90065-T_bib12","first-page":"5","article-title":"An introduction to first order logic","volume":"90","author":"Barwise","year":"1977"},{"key":"10.1016\/0168-0072(91)90065-T_bib13","series-title":"Algebraic Semantics","first-page":"35","article-title":"Theory and practice of sequential algorithms: the kernel of the applicative language CDS","author":"Berry","year":"1985"},{"key":"10.1016\/0168-0072(91)90065-T_bib14","series-title":"Algebraic Semantics","first-page":"89","article-title":"Full abstraction for sequential languages: the state of the art","author":"Berry","year":"1985"},{"key":"10.1016\/0168-0072(91)90065-T_bib15","article-title":"Model Theory","volume":"73","author":"Chang","year":"1977"},{"key":"10.1016\/0168-0072(91)90065-T_bib16","first-page":"241","article-title":"Extended type structure and filter lambda models","volume":"112","author":"Coppo","year":"1984"},{"key":"10.1016\/0168-0072(91)90065-T_bib17","series-title":"9th Ann. ACM Symp. on the Principles of Programming Languages","first-page":"207","article-title":"Principal type schemes for functional programs","author":"Damas","year":"1982"},{"key":"10.1016\/0168-0072(91)90065-T_bib18","series-title":"Mathematical Theory of Program Correctness","author":"de Bakker","year":"1980"},{"key":"10.1016\/0168-0072(91)90065-T_bib19","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/S0019-9958(82)91250-5","article-title":"Processes and the denotational semantics of concurrency","volume":"54","author":"de Bakker","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0168-0072(91)90065-T_bib20","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0168-0072(91)90065-T_bib21","series-title":"Topology","author":"Dugundji","year":"1966"},{"issue":"2","key":"10.1016\/0168-0072(91)90065-T_bib22","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0304-3975(76)90029-3","article-title":"Computability concepts for programming language semantics","volume":"2","author":"Egli","year":"1976","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/0168-0072(91)90065-T_bib23","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF02219096","article-title":"Computable functionals of finite types","volume":"11","author":"Ershov","year":"1972","journal-title":"Algebra and Logic"},{"key":"10.1016\/0168-0072(91)90065-T_bib24","series-title":"A Compendium of Continuous Lattices","author":"Gierz","year":"1980"},{"issue":"1","key":"10.1016\/0168-0072(91)90065-T_bib25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear Logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(91)90065-T_bib26","series-title":"The Denotational Description of Programming Languages","author":"Gordon","year":"1979"},{"key":"10.1016\/0168-0072(91)90065-T_bib27","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/BF00288467","article-title":"A logic for the specification and proof of regular controllable processes of CCS","volume":"23","author":"Graf","year":"1986","journal-title":"Acta Inform."},{"key":"10.1016\/0168-0072(91)90065-T_bib28","series-title":"Technical Report CMU-CS-85-107","article-title":"Profinite solutions for recursive domain equations","author":"Gunter","year":"1985"},{"key":"10.1016\/0168-0072(91)90065-T_bib29","series-title":"Symp. on Logic in Computer Science","first-page":"142","article-title":"The largest first-order axiomatizable cartesian closed category of domains","author":"Gunter","year":"1986"},{"issue":"1","key":"10.1016\/0168-0072(91)90065-T_bib30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(87)90048-4","article-title":"Universal profinite domains","volume":"72","author":"Gunter","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/0168-0072(91)90065-T_bib31","article-title":"First Order Dynamic Logic","volume":"68","author":"Harel","year":"1979"},{"key":"10.1016\/0168-0072(91)90065-T_bib32","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","article-title":"Algebraic laws for non-determinism and concurrency","volume":"32","author":"Hennessy","year":"1985","journal-title":"J. Assoc. Comput. Mech."},{"key":"10.1016\/0168-0072(91)90065-T_bib33","article-title":"Full abstraction for a simple parallel programming language","volume":"74","author":"Hennessy","year":"1979"},{"key":"10.1016\/0168-0072(91)90065-T_bib34","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Comm. ACM"},{"key":"10.1016\/0168-0072(91)90065-T_bib35","first-page":"264","article-title":"Function spaces in the category of locales","volume":"871","author":"Hyland","year":"1981"},{"key":"10.1016\/0168-0072(91)90065-T_bib36","article-title":"Stone Spaces","volume":"3","author":"Johnstone","year":"1982"},{"key":"10.1016\/0168-0072(91)90065-T_bib37","first-page":"155","article-title":"Vietoris locales and localic semi-lattices","volume":"101","author":"Johnstone","year":"1985"},{"key":"10.1016\/0168-0072(91)90065-T_bib38","article-title":"Fully effective solutions of recursive domain equations","volume":"74","author":"Kanda","year":"1979"},{"key":"10.1016\/0168-0072(91)90065-T_bib39","series-title":"Ph.D. thesis","article-title":"Fully effective solutions of recursive domain equations","author":"Kanda","year":"1980"},{"key":"10.1016\/0168-0072(91)90065-T_bib40","first-page":"351","article-title":"A representation theorem for models of \u2605-free PDL","volume":"85","author":"Kozen","year":"1980"},{"key":"10.1016\/0168-0072(91)90065-T_bib41","first-page":"1","article-title":"On the duality of dynamic algebras and Kripke models","volume":"125","author":"Kozen","year":"1981"},{"key":"10.1016\/0168-0072(91)90065-T_bib42","series-title":"15th Ann. ACM Symp. on Theory of Computing","first-page":"291","article-title":"A probabilistic PDL","author":"Kozen","year":"1983"},{"key":"10.1016\/0168-0072(91)90065-T_bib43","series-title":"Constructivity in Mathematics","article-title":"Interpretation of analysis by means of functionals of finite type","author":"Kreisel","year":"1959"},{"key":"10.1016\/0168-0072(91)90065-T_bib44","article-title":"Introduction to Higher Order Categorial Logic","volume":"7","author":"Lambek","year":"1986"},{"key":"10.1016\/0168-0072(91)90065-T_bib45","first-page":"109","article-title":"Using information systems to solve recursive domain equations effectively","volume":"173","author":"Larsen","year":"1984"},{"key":"10.1016\/0168-0072(91)90065-T_bib46","article-title":"Metric spaces, generalized logic, and closed categories","volume":"XLIII","author":"Lawvere","year":"1973"},{"key":"10.1016\/0168-0072(91)90065-T_bib47","series-title":"Categories for the Working Mathematician","author":"Mac Lane","year":"1971"},{"key":"10.1016\/0168-0072(91)90065-T_bib48","series-title":"Notes on Constructive Mathematics","author":"Martin-L\u00f6f","year":"1970"},{"key":"10.1016\/0168-0072(91)90065-T_bib49","series-title":"Workshop on the Semantics of Programming Languages","article-title":"Lecture notes on the domain interpretation of type theory","author":"Martin-L\u00f6f","year":"1983"},{"key":"10.1016\/0168-0072(91)90065-T_bib50","series-title":"Ph.D. Thesis","article-title":"Metric domains for completeness","author":"Matthews","year":"1985"},{"key":"10.1016\/0168-0072(91)90065-T_bib51","series-title":"A theory of Programming Language Semantics","author":"Milne","year":"1976"},{"issue":"1","key":"10.1016\/0168-0072(91)90065-T_bib52","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","article-title":"Fully abstract models of typed \u03bb-calculi","volume":"4","author":"Milner","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(91)90065-T_bib53","article-title":"A Calculus for Communicating Systems","volume":"92","author":"Milner","year":"1980"},{"issue":"3","key":"10.1016\/0168-0072(91)90065-T_bib54","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","article-title":"Calculi for synchrony and asynchrony","volume":"25","author":"Milner","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(91)90065-T_bib55","series-title":"Ph.D. Thesis","article-title":"Abstract interpretation and optimising transformations for applicative programs","author":"Mycroft","year":"1981"},{"key":"10.1016\/0168-0072(91)90065-T_bib56","series-title":"Ph.D. Thesis","article-title":"Abstract interpretation using domain theory","author":"Nielsen","year":"1984"},{"key":"10.1016\/0168-0072(91)90065-T_bib57","series-title":"Foundations of Computer Science III, Part 2, Math. Centre Tracts 109","first-page":"3","article-title":"Infinite words, infinite trees, infinite computations","author":"Nivat","year":"1981"},{"key":"10.1016\/0168-0072(91)90065-T_bib58","series-title":"Algebraic Semantics","first-page":"543","article-title":"Type categories, functor categories and block structure","author":"Oles","year":"1985"},{"key":"10.1016\/0168-0072(91)90065-T_bib59","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","article-title":"A powerdomain construction","volume":"5","author":"Plotkin","year":"1976","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0168-0072(91)90065-T_bib60","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","article-title":"LCF considered as a programming language","volume":"5","author":"Plotkin","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(91)90065-T_bib61","series-title":"Post-graduate lecture notes in advanced domain theory (incorporating the \u201cPisa Notes\u201d)","author":"Plotkin","year":"1981"},{"key":"10.1016\/0168-0072(91)90065-T_bib62","first-page":"412","article-title":"A powerdomain for countable non-determinism","volume":"140","author":"Plotkin","year":"1982"},{"key":"10.1016\/0168-0072(91)90065-T_bib63","series-title":"Workshop on the Semantics of Programming Languages, Chalmers","article-title":"A metalanguage for predomains","author":"Plotkin","year":"1983"},{"key":"10.1016\/0168-0072(91)90065-T_bib64","article-title":"Lectures on predomains and partial functions","author":"Plotkin","year":"1985","journal-title":"Notes for a course given at the Center for the Study of Language and Information"},{"key":"10.1016\/0168-0072(91)90065-T_bib65","series-title":"Theoretical Aspects of Reasoning About Knowledge: Proceedings of the 1986 Conference","first-page":"399","article-title":"A framework for intuitionistic modal logics (extended abstract)","author":"Plotkin","year":"1986"},{"key":"10.1016\/0168-0072(91)90065-T_bib66","series-title":"Proc. 19th Ann. Symp. on the Foundations of Computer Science","article-title":"The temporal logic of programs","author":"Pnueli","year":"1977"},{"key":"10.1016\/0168-0072(91)90065-T_bib67","doi-asserted-by":"crossref","DOI":"10.1016\/S0019-9958(86)80027-4","article-title":"On specifications, theories and models with higher types","volume":"68","author":"Poign\u00e9","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0168-0072(91)90065-T_bib68","series-title":"Draft paper","article-title":"Foundations are rich institutions, but institutions are poor foundations","author":"Poign\u00e9","year":"1987"},{"key":"10.1016\/0168-0072(91)90065-T_bib69","first-page":"53","article-title":"Dynamic Logic","volume":"109","author":"Pratt","year":"1981"},{"key":"10.1016\/0168-0072(91)90065-T_bib70","series-title":"Summer Conference on Category Theory and Computer Science, Lecture Notes in Comput. Sci.","article-title":"Logical aspects of denotational semantics","author":"Robinson","year":"1988"},{"key":"10.1016\/0168-0072(91)90065-T_bib71","series-title":"Denotational Semantics","author":"Schmidt","year":"1986"},{"key":"10.1016\/0168-0072(91)90065-T_bib72","first-page":"169","article-title":"Outline of a mathematical theory of computation","author":"Scott","year":"1970","journal-title":"4th Ann. Princeton Conference on Information Sciences and Systems"},{"key":"10.1016\/0168-0072(91)90065-T_bib73","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\/0168-0072(91)90065-T_bib74","first-page":"223","article-title":"Lambda calculus: Some models, some philosophy","volume":"101","author":"Scott","year":"1980"},{"key":"10.1016\/0168-0072(91)90065-T_bib75","series-title":"Monograph PRG-19","article-title":"Lectures on a mathematical theory of computation","author":"Scott","year":"1981"},{"key":"10.1016\/0168-0072(91)90065-T_bib76","article-title":"Domains for denotational semantics","volume":"140","author":"Scott","year":"1982"},{"issue":"3","key":"10.1016\/0168-0072(91)90065-T_bib77","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0304-3975(77)90045-7","article-title":"Effectively given domains","volume":"5","author":"Smyth","year":"1977","journal-title":"Theoret. Comput. Sci."},{"issue":"1,2","key":"10.1016\/0168-0072(91)90065-T_bib78","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(83)90095-6","article-title":"The largest cartesian closed category of domains","volume":"27","author":"Smyth","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(91)90065-T_bib79","first-page":"662","article-title":"Powerdomains and predicate transformers: a topological view","volume":"154","author":"Smyth","year":"1983"},{"key":"10.1016\/0168-0072(91)90065-T_bib80","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/0211062","article-title":"The category-theoretic solution of recursive domain equations","volume":"11","author":"Smyth","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0168-0072(91)90065-T_bib81","series-title":"Perspect. Math. Logic","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7_3","article-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"},{"issue":"2,3","key":"10.1016\/0168-0072(91)90065-T_bib82","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(87)90012-0","article-title":"Modal logics for communicating systems","volume":"49","author":"Stirling","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(91)90065-T_bib83","first-page":"37","article-title":"The theory of representations for Boolean algebras","author":"Stone","year":"1936","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0168-0072(91)90065-T_bib84","unstructured":"J.E. Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Language theory, MIT Press Ser. Comput. Sci. (MIT Press, Cambridge, MA)."},{"key":"10.1016\/0168-0072(91)90065-T_bib85","series-title":"Draft paper","article-title":"USCC","author":"Vickers","year":"1987"},{"key":"10.1016\/0168-0072(91)90065-T_bib86","series-title":"Cambridge Tracts Theoret. Comput. Sci.","article-title":"Topology Via Logic","author":"Vickers","year":"1988"},{"key":"10.1016\/0168-0072(91)90065-T_bib87","series-title":"Ph.D. Thesis","article-title":"Events in Computation","author":"Winskel","year":"1980"},{"key":"10.1016\/0168-0072(91)90065-T_bib88","first-page":"392","article-title":"A complete proof system for SCCS with modal assertions","volume":"206","author":"Winskel","year":"1985"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729190065T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729190065T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:52:30Z","timestamp":1555141950000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016800729190065T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":90,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["016800729190065T"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(91)90065-t","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}