{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T04:28:28Z","timestamp":1716956908611},"reference-count":37,"publisher":"Elsevier BV","issue":"1","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":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5311,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0304-3975(98)00099-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T01:04:53Z","timestamp":1027645493000},"page":"121-157","source":"Crossref","is-referenced-by-count":15,"title":["Induction and recursion on the partial real line with applications to Real PCF"],"prefix":"10.1016","volume":"210","author":[{"given":"Mart\u00edn H\u00f6tzel","family":"Escard\u00f3","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Streicher","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00099-1_BIB1","first-page":"1","article-title":"Domain theory","volume":"vol. 3","author":"Abramsky","year":"1994"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB2","series-title":"Abstract and Concrete Categories","author":"Adamek","year":"1990"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB3","series-title":"Introduction to Functional Programming","author":"Bird","year":"1988"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB4","series-title":"Proc. 11th Annual IEEE Symp. on Logic in Computer Science","first-page":"382","article-title":"Integration in Real PCF (extended abstract)","author":"Edalat","year":"1996"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB5","doi-asserted-by":"crossref","unstructured":"A. Edalat, Ph. S\u00fcnderhauf, A domain-theoretic approach to computability on the real line, Theoret. Comput. Sci., this issue.","DOI":"10.1016\/S0304-3975(98)00097-8"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0304-3975(76)90029-3","article-title":"Computability concepts for programming languages","volume":"2","author":"Egli","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00099-1_BIB7","doi-asserted-by":"crossref","DOI":"10.1016\/S0166-8641(97)00225-3","article-title":"Properly injective spaces and function spaces","volume":"89","author":"Escard\u00f3","year":"1998","journal-title":"Topology and its Applications"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB8","series-title":"Theory and Formal Methods 1994, Proc. 2nd Imperial College Department of Computing Workshop on Theory and Formal Methods, Miller Centre","first-page":"259","article-title":"Induction and recursion on the real line","author":"Escard\u00f3","year":"1995"},{"issue":"1","key":"10.1016\/S0304-3975(98)00099-1_BIB9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0304-3975(95)00250-2","article-title":"PCF extended with real numbers","volume":"162","author":"Escard\u00f3","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00099-1_BIB10","series-title":"Advances in Theory and Formal Methods of Computing, Proc. 3rd Imperial College Workshop","first-page":"13","article-title":"Real PCF extended with \u2203 is universal","author":"Escard\u00f3","year":"1996"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB11_1","series-title":"Technical Report ECS-LFCS-97-374","article-title":"PCF extended with real numbers: a domain-theoretic approach to higher-order exact real number computation","author":"Escard\u00f3","year":"1997"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB11_2","series-title":"Ph.D. thesis","author":"Escard\u00f3","year":"1997"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB12","series-title":"Proc. 12th Annual IEEE Symp. on Logic in Computer Science","article-title":"Induction and recursion on the partial real line via biquotients of bifree algebras (extended abstract)","author":"Escard\u00f3","year":"1997"},{"issue":"2","key":"10.1016\/S0304-3975(98)00099-1_BIB13","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1006\/inco.1996.0058","article-title":"A coinduction principle for recursive data types based on bisimulation","volume":"127","author":"Fiore","year":"1996","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(98)00099-1_BIB14","first-page":"95","article-title":"Algebraically complete categories","volume":"vol. 1488","author":"Freyd","year":"1991"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB15","series-title":"Applications of Categories in Computer Science: Proc. LMS Symp.","article-title":"Remarks on algebraically compact categories","volume":"vol. 177","author":"Freyd","year":"1992"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB16","series-title":"A Compendium of Continuous Lattices","author":"Gierz","year":"1980"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB17","article-title":"Edinburgh LCF","volume":"vol. 78","author":"Gordon","year":"1979"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB18","series-title":"Semantics of Programming Languages \u2014 Structures and Techniques","author":"Gunter","year":"1992"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB19","series-title":"Theoretical Computer Science 4th GI Conf.","article-title":"When are two effectively given domains identical?","author":"Kanda","year":"1979"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB20","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01752392","article-title":"Algebraic specification of data types: a synthetic approach","volume":"14","author":"Lehmann","year":"1981","journal-title":"Math. System Theory"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB21","series-title":"Interval Analysis","author":"Moore","year":"1966"},{"issue":"1","key":"10.1016\/S0304-3975(98)00099-1_BIB22","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\/S0304-3975(98)00099-1_BIB23","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(78)90006-5","article-title":"B\u03c9 as a universal domain","volume":"17","author":"Plotkin","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(98)00099-1_BIB24","series-title":"Domains, Post-graduate Lectures in advanced domain theory","author":"Plotkin","year":"1980"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB25","first-page":"413","article-title":"Basic category theory","volume":"vol. 1","author":"Poigne","year":"1992"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB26","series-title":"Real Analysis","author":"Royden","year":"1988"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB27","series-title":"Lectures Notes in Mathematics","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BFb0073967","article-title":"Continuous lattices","volume":"vol. 274","author":"Scott","year":"1972"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB28","series-title":"Formal semantics of programming languages","first-page":"66","article-title":"Lattice theory, data types and semantics","author":"Scott","year":"1972"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB29","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0304-3975(93)90095-B","article-title":"A type-theoretical alternative to CUCH, ISWIM and OWHY","volume":"121","author":"Scott","year":"1993","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0304-3975(98)00099-1_BIB30","first-page":"256","article-title":"Effectively given domains","volume":"5","author":"Smyth","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00099-1_BIB31","series-title":"Automata, Languages and Programming","first-page":"662","article-title":"Power domains and predicate transformers: a topological view","author":"Smyth","year":"1983"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB32","series-title":"Applications of Categories in Computer Science","first-page":"270","article-title":"I-categories and duality","author":"Smyth","year":"1992"},{"key":"10.1016\/S0304-3975(98)00099-1_BIB33","first-page":"641","article-title":"Topology","volume":"vol. 1","author":"Smyth","year":"1992"},{"issue":"4","key":"10.1016\/S0304-3975(98)00099-1_BIB34","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\/S0304-3975(98)00099-1_BIB35","series-title":"Set Theory and Logic","author":"Stoll","year":"1966"},{"issue":"1","key":"10.1016\/S0304-3975(98)00099-1_BIB36","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1017\/S0960129500000384","article-title":"A universality theorem for PCF with recursive types","volume":"4","author":"Streicher","year":"1994","journal-title":"parallel-or and \u2203, Math. Struct. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000991?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000991?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:50:54Z","timestamp":1555390254000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598000991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0304397598000991"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00099-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}