{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:24Z","timestamp":1761611064493},"reference-count":27,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"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":5160,"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,6]]},"DOI":"10.1016\/s0304-3975(99)00036-5","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"295-326","source":"Crossref","is-referenced-by-count":19,"title":["An abstract data type for real numbers"],"prefix":"10.1016","volume":"221","author":[{"given":"Pietro","family":"Di Gianantonio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00036-5_bib1","series-title":"Computable Analysis","author":"Aberth","year":"1980"},{"key":"10.1016\/S0304-3975(99)00036-5_bib2","series-title":"Proc. 5th Internat. Coll. on Automata Languages and Programming","article-title":"Stable models of the typed lambda-calculi","volume":"vol. 62","author":"Berry","year":"1978"},{"key":"10.1016\/S0304-3975(99)00036-5_bib3","series-title":"Foundation of Constructive Analysis","author":"Bishop","year":"1967"},{"key":"10.1016\/S0304-3975(99)00036-5_bib4","series-title":"Research Topics in Functional Programming","first-page":"43","article-title":"Exact real arithmetic: formulating real numbers as functions","author":"Boehm","year":"1990"},{"key":"10.1016\/S0304-3975(99)00036-5_bib5","series-title":"ACM Symp. on Lisp and Functional Programming","article-title":"Exact real arithmetic: a case study in higher order programming","author":"Boehm","year":"1986"},{"issue":"2","key":"10.1016\/S0304-3975(99)00036-5_bib6","first-page":"1","article-title":"Algorithmic operators in constructive metric spaces","volume":"64","author":"Ceitin","year":"1967","journal-title":"Trudy Mat. Inst. Steklov"},{"key":"10.1016\/S0304-3975(99)00036-5_bib7","series-title":"MSRI Proc.","article-title":"Computability and complexity of higher type functions","author":"Cook","year":"1990"},{"key":"10.1016\/S0304-3975(99)00036-5_bib8","article-title":"A functional approach to real number computation","author":"Di Gianantonio","year":"1993"},{"issue":"1","key":"10.1016\/S0304-3975(99)00036-5_bib9","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1006\/inco.1996.0046","article-title":"Real number computability and domain theory","volume":"127","author":"Di Gianantonio","year":"1996","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00036-5_bib10","series-title":"IEEE Symp. on Logic in Computer Science","first-page":"382","article-title":"Integration in real PCF","author":"Edalat","year":"1996"},{"key":"10.1016\/S0304-3975(99)00036-5_bib11","series-title":"MFPS 97","article-title":"A new representation for the exact real numbers","volume":"vol. 6","author":"Edalat","year":"1997"},{"key":"10.1016\/S0304-3975(99)00036-5_bib12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0304-3975(95)00250-2","article-title":"PCF extended with real numbers","author":"Escardo","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00036-5_bib13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.4064\/fm-44-1-61-71","article-title":"On the definition of computable real continuous functions","volume":"44","author":"Grzegorczyk","year":"1957","journal-title":"Fund. Math."},{"key":"10.1016\/S0304-3975(99)00036-5_bib14","series-title":"Constructivity in Mathematics","first-page":"129","article-title":"Quelques proc\u00e9d\u00e9s de d\u00e9finitions en topologie recursif","author":"Lacombe","year":"1959"},{"key":"10.1016\/S0304-3975(99)00036-5_bib15","series-title":"Note on Constructive Mathematics","author":"Martin-L\u00f6f","year":"1970"},{"key":"10.1016\/S0304-3975(99)00036-5_bib16","article-title":"Arithm\u00e9tique exacte, conception, algorithmique et performances d'une impl\u00e9mentation informatique en prcision arbitraire","author":"M\u00e9nissier-Morain","year":"1994"},{"key":"10.1016\/S0304-3975(99)00036-5_bib17","unstructured":"V. M\u00e9nissier-Morain, Arbitrary precission real arithmetic: design and algorithms, J. Symbolic Comput., Submitted. Available at http:\/\/pauillac.inria.fr\/menissier"},{"key":"10.1016\/S0304-3975(99)00036-5_bib18","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","article-title":"LCF considered as a programing language","volume":"5","author":"Plotkin","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00036-5_bib19","series-title":"IEEE Symp. on Logic in Computer Science","article-title":"Semantcis of exat real arithmetic","author":"Potts","year":"1997"},{"key":"10.1016\/S0304-3975(99)00036-5_bib20","first-page":"784","article-title":"Recursive real numbers","volume":"5","author":"Rice","year":"1954"},{"key":"10.1016\/S0304-3975(99)00036-5_bib21","series-title":"Proc. 4th Princeton Conf. on Information Science","article-title":"Outline of the mathematical theory of computation","author":"Scott","year":"1970"},{"key":"10.1016\/S0304-3975(99)00036-5_bib22","series-title":"MFCS 1998","article-title":"Lazy functional algorithms for exact real functionals","author":"Simpson","year":"1998"},{"issue":"1","key":"10.1016\/S0304-3975(99)00036-5_bib23","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1017\/S0960129500000384","article-title":"A universality theorem for pcf with recursive types, parallel-or and \u2203","volume":"4","author":"Streicher","year":"1994","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00036-5_bib24","series-title":"Constructivism in Mathematics","author":"Troelstra","year":"1988"},{"key":"10.1016\/S0304-3975(99)00036-5_bib25","first-page":"230","article-title":"On computable numbers, with an application to the entscheidungs problem","volume":"42","author":"Turing","year":"1937"},{"key":"10.1016\/S0304-3975(99)00036-5_bib26","series-title":"Proc. ACM Conf. on Lisp and functional Programming","first-page":"14","article-title":"Exact real computer arithmetic with continued fraction","author":"Vuillemin","year":"1988"},{"key":"10.1016\/S0304-3975(99)00036-5_bib27","series-title":"Computability","author":"Weihrauch","year":"1987"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000365?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000365?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T17:19:53Z","timestamp":1578676793000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599000365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0304397599000365"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00036-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}