{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T14:30:34Z","timestamp":1648909834781},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3681,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s1571-0661(04)80642-x","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"237-256","source":"Crossref","is-referenced-by-count":0,"title":["Computable Functions on Final Coalgebras"],"prefix":"10.1016","volume":"82","author":[{"given":"Dirk","family":"Pattinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80642-X_NEWBIB1","article-title":"Domain Theory","volume":"volume 3","author":"Abramsky","year":"1994"},{"key":"10.1016\/S1571-0661(04)80642-X_NEWBIB2","series-title":"Typed Lambda Calculi and Applications volume 2044 of Lect. Notes in Comp. Sci.","first-page":"8","article-title":"Representations of first order function types as terminal coalgebras","author":"Altenkirch","year":"2001"},{"key":"10.1016\/S1571-0661(04)80642-X_NEWBIB3","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0304-3975(93)90076-6","article-title":"Terminal coalgebras in well-fonded set theory","volume":"114","author":"Barr","year":"1993","journal-title":"Theor. Comp. Sci"},{"key":"10.1016\/S1571-0661(04)80642-X_NEWBIB4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0168-0072(93)90038-F","article-title":"Total Sets and Objects in Domain Theory","volume":"60","author":"Berger","year":"1993","journal-title":"Journal of Pure and Applied Logic"},{"key":"10.1016\/S1571-0661(04)80642-X_NEWBIB5","doi-asserted-by":"crossref","unstructured":"T. Coquand. Infinite Objects in Type Theory. In H. Barendregt and T. Nipkow, editors, Types for Proofs and Programs, volume 806 of Lecture Notes in Computer Science, pages 62\u201378. Springer, 1993.","DOI":"10.1007\/3-540-58085-9_72"},{"key":"10.1016\/S1571-0661(04)80642-X_NEWBIB6","series-title":"Computability","author":"Cutland","year":"1980"},{"key":"10.1016\/S1571-0661(04)80642-X_NEWBIB7","series-title":"Constructive Analysis","author":"Bishop","year":"1985"},{"key":"10.1016\/S1571-0661(04)80642-X_NEWBIB8","series-title":"Classical Recursion Theory","author":"Odifreddi","year":"1989"},{"key":"10.1016\/S1571-0661(04)80642-X_NEWBIB9","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":"Theor. Comp. Sci"},{"issue":"1","key":"10.1016\/S1571-0661(04)80642-X_NEWBIB10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","article-title":"Universal Coalgebra: A theory of systems","volume":"249","author":"Rutten","year":"2000","journal-title":"Theor. Comp. Sci"},{"key":"10.1016\/S1571-0661(04)80642-X_NEWBIB11","series-title":"Handbook of Computability Theory","article-title":"Classifying Recursive Functions","author":"Schwichtenberg","year":"1999"},{"key":"10.1016\/S1571-0661(04)80642-X_NEWBIB12","series-title":"Mathematical Theory of Domains","author":"Stoltenberg-Hansen","year":"1994"},{"key":"10.1016\/S1571-0661(04)80642-X_NEWBIB13","doi-asserted-by":"crossref","unstructured":"A. Telford and D. Turner. Ensuring Streams Flow. In M. Johnson, editor, Algebraic Methodology and Software Technology, volume 1349 of Lecture Notes in Computer Science, pages 509\u2013523. Springer, 1997.","DOI":"10.1007\/BFb0000493"},{"issue":"5","key":"10.1016\/S1571-0661(04)80642-X_NEWBIB14","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1017\/S0960129598002588","article-title":"On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces","volume":"8","author":"Turi","year":"1998","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(04)80642-X_NEWBIB15","first-page":"5","article-title":"Primitive (Co)Recursion and Course of Value (Co)Iteration, Categorically","volume":"10","author":"Uustalu","year":"1999","journal-title":"INFORMATICA (IMI, Lithuania)"},{"key":"10.1016\/S1571-0661(04)80642-X_NEWBIB16","series-title":"Computability","author":"Weihrauch","year":"1987"},{"key":"10.1016\/S1571-0661(04)80642-X_NEWBIB17","series-title":"Coalgebraic Methods in Computer Science (CMCS'99) volume 19 of Electr. Notes in Theoret. Comp. Sci.","article-title":"Terminal Sequences for Accessible Endofunctors","author":"Worrell","year":"1999"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610480642X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610480642X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T07:13:30Z","timestamp":1585898010000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610480642X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S157106610480642X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80642-x","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}