{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T00:07:41Z","timestamp":1715126861168},"reference-count":30,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2013,3,19]],"date-time":"2013-03-19T00:00:00Z","timestamp":1363651200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2014,2]]},"abstract":"<jats:p>We develop an operational domain theory for treating recursive types with respect to contextual equivalence. The principal approach we take deviates from classical domain theory in that we do not produce the recursive types using the usual inverse limits constructions \u2013 we get them for free by working directly with the operational semantics. By extending type expressions to functors between some \u2018syntactic\u2019 categories, we establish algebraic compactness. To do this, we rely on an operational version of the minimal invariance property, for which we give a purely operational proof.<\/jats:p>","DOI":"10.1017\/s0960129512001004","type":"journal-article","created":{"date-parts":[[2013,3,19]],"date-time":"2013-03-19T14:21:46Z","timestamp":1363702906000},"source":"Crossref","is-referenced-by-count":0,"title":["An operational domain-theoretic treatment of recursive types"],"prefix":"10.1017","volume":"24","author":[{"given":"WENG KIN","family":"HO","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2013,3,19]]},"reference":[{"key":"S0960129512001004_ref18","first-page":"91","volume-title":"Higher Order Operational Techniques in Semantics","author":"Lassen","year":"1998"},{"key":"S0960129512001004_ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1994.316083"},{"key":"S0960129512001004_ref22","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1999.2845"},{"key":"S0960129512001004_ref15","first-page":"198","volume-title":"Proceedings of the 4th Annual Symposium on Logic In Computer Science","author":"Howe","year":"1989"},{"key":"S0960129512001004_ref28","unstructured":"Rohr A. (2002) A Universal Realizability Model for Sequential Functional Computation, Ph.D. thesis, Technischen Universitat Darmstadt."},{"key":"S0960129512001004_ref9","first-page":"95","article-title":"Algebraically complete categories","volume":"1488","author":"Freyd","year":"1991","journal-title":"Springer-Verlag Lecture Notes in Computer Science"},{"key":"S0960129512001004_ref2","first-page":"1","volume-title":"Handbook of logic in computer science, volume 3: semantic structures","author":"Abramsky","year":"1994"},{"key":"S0960129512001004_ref14","unstructured":"Ho W. K. (2006b) An operational domain theory and topology of sequential functional languages, Ph.D. thesis, The University of Brimingham."},{"key":"S0960129512001004_ref5","doi-asserted-by":"crossref","unstructured":"Fiore M. P. (1996) Axiomatic Domain Theory in Categories of Partial Maps, Ph.D. thesis, University of Edinburgh. Published in 2004 as: Distinguished Dissertations in Computer Science 14, Cambridge University Press.","DOI":"10.1017\/CBO9780511526565"},{"key":"S0960129512001004_ref3","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1999.2828"},{"key":"S0960129512001004_ref30","first-page":"323","article-title":"Lazy functional algorithms for exact real functionals","volume":"1450","author":"Simpson","year":"1998","journal-title":"Springer-Verlag Lecture Notes in Computer Science"},{"key":"S0960129512001004_ref11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511542725"},{"key":"S0960129512001004_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.12.003"},{"key":"S0960129512001004_ref16","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0008"},{"key":"S0960129512001004_ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90044-5"},{"key":"S0960129512001004_ref24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526619.007"},{"key":"S0960129512001004_ref29","unstructured":"Simpson A. K. (1992) Recursive Types in Kleisli Categories. Available from http:\/\/homepages.inf.ed.ac.uk\/als\/Research."},{"key":"S0960129512001004_ref20","volume-title":"Categories for the Working Mathematician","author":"Mac Lane","year":"1998"},{"key":"S0960129512001004_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90015-8"},{"key":"S0960129512001004_ref8","first-page":"498","volume-title":"Proceedings of the 5th Annual IEEE Symposium on Logic In Computer Science","author":"Freyd","year":"1990"},{"key":"S0960129512001004_ref19","doi-asserted-by":"crossref","unstructured":"Lassen S. B. (1998b) Relational Reasoning about Functions and Nondeterminism, Ph.D. thesis, University of Aarhus.","DOI":"10.7146\/brics.v4i24.18950"},{"key":"S0960129512001004_ref27","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1093\/oso\/9780198537359.003.0004","volume-title":"Handbook of logic in computer science, volume 1: Background \u2013 Mathematical Structures","author":"Poign\u00e9","year":"1992"},{"key":"S0960129512001004_ref1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1996.561324"},{"key":"S0960129512001004_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90046-1"},{"key":"S0960129512001004_ref26","unstructured":"Plotkin G. D. (1985) Lectures on predomains and partial functions. Notes for a course given at the Center for the Study of Languages and Information, Stanford."},{"key":"S0960129512001004_ref23","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0052"},{"key":"S0960129512001004_ref10","volume-title":"Applications of Categories in Computer Science","author":"Freyd","year":"1992"},{"key":"S0960129512001004_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90125-6"},{"key":"S0960129512001004_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2006.04.013"},{"key":"S0960129512001004_ref21","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0061"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129512001004","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T17:22:16Z","timestamp":1715102536000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129512001004\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,19]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["S0960129512001004"],"URL":"https:\/\/doi.org\/10.1017\/s0960129512001004","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,19]]},"article-number":"e240101"}}