{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:35Z","timestamp":1761610355455,"version":"build-2065373602"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5323,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1999]]},"DOI":"10.1016\/s1571-0661(05)80322-6","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"301-324","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A Domain-theoretic Semantics of Lax Generic Functions"],"prefix":"10.1016","volume":"29","author":[{"given":"Hideki","family":"Tsuiki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80322-6_BIBBMM88","first-page":"76","article-title":"The semantics of second-order lambda calculus","volume":"59","author":"Bruce","year":"1988","journal-title":"Information and Computation"},{"year":"1990","series-title":"Category Theory for Computing Science","author":"Barr","key":"10.1016\/S1571-0661(05)80322-6_BIBBW90"},{"issue":"1","key":"10.1016\/S1571-0661(05)80322-6_BIBCGL95","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1006\/inco.1995.1033","article-title":"A calculus for overloaded functions with subtyping","volume":"117","author":"Castagna","year":"1995","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80322-6_BIBFIO94","series-title":"PhD thesis, University of Edinburgh","article-title":"Axiomatic Domain Theory in Categories of Partial Maps","author":"Fiore","year":"1994"},{"key":"10.1016\/S1571-0661(05)80322-6_BIBFRE91","series-title":"Proc. 1990 Como Category Theory Conference, Lec. Notes in Math. 1488","first-page":"95","article-title":"Algebraically complete categories","author":"Freyd","year":"1991"},{"key":"10.1016\/S1571-0661(05)80322-6_BIBGIR71","series-title":"Proc. 2nd Scandinavian Logic Symposium","first-page":"63","article-title":"Une extension de l'interpr\u00e9tation de g\u00f6del \u00e1 l'analyse et son application \u00e1 l'\u00e9limination des coupures dans l'analyse et la th\u00e9orie des types","author":"Girard","year":"1971"},{"year":"1996","series-title":"The Java Language Specification","author":"Gosling","key":"10.1016\/S1571-0661(05)80322-6_BIBGJGL96"},{"key":"10.1016\/S1571-0661(05)80322-6_BIBHAS94","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1017\/S0960129500000372","article-title":"Categorical data types in parametric polymorphism","volume":"4","author":"Hasegawa","year":"1994","journal-title":"Math.Struct, in Comp. Science"},{"key":"10.1016\/S1571-0661(05)80322-6_BIBJAC99","series-title":"North Holland, Elsevier","article-title":"Categorical Logic and Type Theory","author":"Jacobs","year":"1999"},{"key":"10.1016\/S1571-0661(05)80322-6_BIBPHO92","article-title":"An introduction to fibrations, topos theory, the effective topos and modest sets","author":"Phoa","year":"1992","journal-title":"Technical Report ECS-LFCS-92-208, Edinburgh University"},{"key":"10.1016\/S1571-0661(05)80322-6_BIBPIT94","doi-asserted-by":"crossref","unstructured":"A. M. Pitts. Computational adequacy via 'mixed' inductive definitions. In Mathematical Foundations of Programming Semantics, Proc. 9th Int. Conf., New Orleans, LA, USA, April 1993, volume 802 of Lecture Notes in Computer Science, pages 72\u201382. Springer-Verlag, Berlin, 1994.","DOI":"10.1007\/3-540-58027-1_3"},{"key":"10.1016\/S1571-0661(05)80322-6_BIBPIT96","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1006\/inco.1996.0052","article-title":"Relational properties of domains","volume":"127","author":"Pitts","year":"1996","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80322-6_BIBREY74","doi-asserted-by":"crossref","unstructured":"J. C. Reynolds. Towards a theory of type structure. In Proceedings, Colloque sur la Programmation, LNCS Vol19, pages 408\u2013425, 1974.","DOI":"10.1007\/3-540-06859-7_148"},{"key":"10.1016\/S1571-0661(05)80322-6_BIBREY81","series-title":"Lecture Notes in Computer Science, 94","article-title":"Using category theory to design implicit conversions and generic operators","author":"Reynolds","year":"1981"},{"key":"10.1016\/S1571-0661(05)80322-6_BIBREY83","series-title":"Information Processing 83","first-page":"513","article-title":"Types, abstraction, and parametric polymorphism","author":"Reynolds","year":"1983"},{"issue":"4","key":"10.1016\/S1571-0661(05)80322-6_BIBSP82","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\/S1571-0661(05)80322-6_BIBTAK95","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1006\/inco.1995.1057","article-title":"Parallel reduction in lambda-calculus","volume":"118","author":"Takahashi","year":"1995","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80322-6_BIBTSU94","first-page":"101","article-title":"On typed calculi with a merge operator","volume":"880","author":"Tsuiki","year":"1994","journal-title":"14thConference on Foundations of Software Technology and Theoretical Computer Science, LNCS"},{"key":"10.1016\/S1571-0661(05)80322-6_BIBTSU95","article-title":"A categorical model of overloading via a domain theory over a functor category","author":"Tsuiki","year":"1995","journal-title":"An earlier version available as a technical report KSU\/ICS-95-01 of Institute of Computer Science, Kyoto Sangyo University, with the title \u201cA Denotational Model of Overloading\u201d"},{"key":"10.1016\/S1571-0661(05)80322-6_BIBTSU98","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1017\/S0960129598002539","article-title":"A computationally adequate model for overloading via domain-valued functors","volume":"8","author":"Tsuiki","year":"1998","journal-title":"Math. Struct. in Comp. Science"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803226?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803226?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:59Z","timestamp":1761610079000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105803226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"references-count":20,"alternative-id":["S1571066105803226"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80322-6","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A Domain-theoretic Semantics of Lax Generic Functions","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80322-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}