{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:07:37Z","timestamp":1725484057215},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540432876"},{"type":"electronic","value":"9783540458425"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45842-5_3","type":"book-chapter","created":{"date-parts":[[2007,5,27]],"date-time":"2007-05-27T00:00:38Z","timestamp":1180224038000},"page":"41-52","source":"Crossref","is-referenced-by-count":3,"title":["A Tour with Constructive Real Numbers"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Ciaffaglione","sequence":"first","affiliation":[]},{"given":"Pietro","family":"Di Gianantonio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,2,14]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"E. Bishop and D. Bridges. \u201cConstructive Analysis\u201d. Springer-Verlag, 1985.","DOI":"10.1007\/978-3-642-61667-9"},{"key":"3_CR2","unstructured":"B. Barras, S. Boutin, et al. \u201cThe Coq proof assistant Reference manual\u201d. INRIA, Project Logical, 2001."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"M. J. Beeson. \u201cFoundations of Constructive Mathematics\u201d. Springer-Verlag, 1985.","DOI":"10.1007\/978-3-642-68952-9"},{"key":"3_CR4","volume-title":"Foundations of constructive analysis","author":"E. Bishop","year":"1967","unstructured":"E. Bishop. \u201cFoundations of constructive analysis\u201d. McGraw-Hill, New York, 1967."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"D. Bridges and S. Reeves. \u201cConstructive mathematics in theroy and programming practice\u201d. Philosophia Mathematica 7, 1999.","DOI":"10.1093\/philmat\/7.1.65"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"D. Bridges. \u201cConstructive mathematics: a foundation for computable analysis\u201d. TCS 219, 1999.","DOI":"10.1016\/S0304-3975(98)00285-0"},{"key":"3_CR7","series-title":"Lect Notes Comput Sci","volume-title":"A co-inductive approach to real numbers","author":"A. Ciaffaglione","year":"2000","unstructured":"A. Ciaffaglione and P. Di Gianantonio. \u201cA co-inductive approach to real numbers\u201d. In Proceedings of Types\u201999, LNCS 1956, 2000."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"A. Ciaffaglione and P. Di Gianantonio. \u201cConstructive Real Numbers in Coq\u201d. Dipartimento di Matematica e Informatica, Udine (Italy), http:\/\/www.dimi.uniud.it\/~ciaffagl\/C_Reals\/index.html , 2001.","DOI":"10.1007\/3-540-45842-5_3"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"T. Coquand and G. Huet. \u201cThe Calculus of Constructions\u201d. Information and Control 76, 1988.","DOI":"10.1016\/0890-5401(88)90005-3"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"H. Geuvers and M. Niqui. \u201cConstructive reals in Coq: axioms and categoricity\u201d. In Proceedings of Types 2000, this Volume, 2001.","DOI":"10.1007\/3-540-45842-5_6"},{"key":"3_CR11","unstructured":"H. Geuvers, R. Pollack, F. Wiedijk, and J. Zwanenburg. \u201cThe Fundamental Theorem of Algebra\u201d Project. Computing Science Institute, Nijmegen (The Netherlands), http:\/\/www.cs.kun.nl\/~freek\/fta\/index.html , 2000."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"P.J. Potts, A. Edalat, and M.H. Escardo. \u201cSemantics of exact real arithmetic\u201d. In IEEE Symposium on Logic in Computer Science, 1997.","DOI":"10.1109\/LICS.1997.614952"},{"key":"3_CR13","unstructured":"A.S. Troelstra and D. van Dalen. \u201cConstructivism in Mathematics\u201d. North-Holland, 1988."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"K. Weihrauch. \u201cComputable Analysis, An Introduction\u201d. Springer-Verlag, 2000.","DOI":"10.1007\/978-3-642-56999-9"}],"container-title":["Lecture Notes in Computer Science","Types for Proofs and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45842-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T01:26:19Z","timestamp":1683854779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45842-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540432876","9783540458425"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45842-5_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}