{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T13:56:40Z","timestamp":1648907800659},"reference-count":10,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":3619,"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,9]]},"DOI":"10.1016\/s1571-0661(04)80754-0","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"1-16","source":"Crossref","is-referenced-by-count":1,"title":["A simple canonical representation of rational numbers"],"prefix":"10.1016","volume":"85","author":[{"given":"Yves","family":"Bertot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80754-0_NEWBIB1","doi-asserted-by":"crossref","unstructured":"Antonia Balaa and Yves Bertot. Fix-point equations for well-founded recursion in type theory. In J. Harrison and M. Aagaard, editors, Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000, volume 1869 of Lecture Notes in Computer Science, pages 1\u201316. Springer-Verlag, 2000.","DOI":"10.1007\/3-540-44659-1_1"},{"key":"10.1016\/S1571-0661(04)80754-0_NEWBIB2","doi-asserted-by":"crossref","unstructured":"Ana Bove and Venanzio Capretta. Nested general recursion and partiality in type theory. In Richard J. Boulton and Paul B. Jackson, editors, Theorem Proving in Higher Order Logics: 14th International Conference, TPHOLs 2001, volume 2152 of Lecture Notes in Computer Science, pages 121\u2013135. Springer-Verlag, September 2001.","DOI":"10.1007\/3-540-44755-5_10"},{"key":"10.1016\/S1571-0661(04)80754-0_NEWBIB3","first-page":"186","article-title":"Calcul des rouages par approximation, nouvelle m\u00e9thode","volume":"3","author":"Achille","year":"1861","journal-title":"Revue chronom\u00e9trique. Journal des horlogers, scientifique et pratique"},{"key":"10.1016\/S1571-0661(04)80754-0_NEWBIB4","unstructured":"David Delahaye and Micaela Mayero. Field: une proc\u00e9dure de d\u00e9cision pour les nombres r\u00e9els en coq. In Proceedings of JFLA'2001. INRIA, 2001."},{"key":"10.1016\/S1571-0661(04)80754-0_NEWBIB5","unstructured":"Bruno Barras et al. The Coq Proof Assistant Reference Manual, Version 7.3. INRIA, http:\/\/coq.inria.fr\/doc\/main.html, oct 2002."},{"issue":"4","key":"10.1016\/S1571-0661(04)80754-0_NEWBIB6","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1511\/2000.29.3334","article-title":"On the teeth of wheels","volume":"88","author":"Brian","year":"2000","journal-title":"American Scientist"},{"issue":"7","key":"10.1016\/S1571-0661(04)80754-0_NEWBIB7","first-page":"484","article-title":"LCF: A lexicographic binary representation of the rationals","volume":"1","author":"Kornerup","year":"1995","journal-title":"Journal of Universal Computer Science"},{"key":"10.1016\/S1571-0661(04)80754-0_NEWBIB8","unstructured":"Milad Niqui. Exact Arithmetic on Stern-Brocot Tree. submitted, jan 2003."},{"key":"10.1016\/S1571-0661(04)80754-0_NEWBIB9","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1515\/crll.1858.55.193","article-title":"Ueber eine zahlentheoretische Funktion","volume":"55","author":"Stern","year":"1858","journal-title":"Journal f\u00fcr die Reine und angewandte Mathematik"},{"issue":"8","key":"10.1016\/S1571-0661(04)80754-0_NEWBIB10","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1109\/12.57047","article-title":"Exact real computer arithmetic with continued fractions","volume":"39","author":"Vuillemin","year":"1990","journal-title":"IEEE Transactions on Computers"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104807540?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104807540?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T10:53:11Z","timestamp":1549191191000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104807540"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":10,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S1571066104807540"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80754-0","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}