{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:18:20Z","timestamp":1725851900889},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662494974"},{"type":"electronic","value":"9783662494981"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49498-1_16","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T13:36:06Z","timestamp":1458567366000},"page":"390-418","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improving Floating-Point Numbers: A Lazy Approach to Adaptive Accuracy Refinement for Numerical Computations"],"prefix":"10.1007","author":[{"given":"Hideyuki","family":"Kawabata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideya","family":"Iwasaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","volume-title":"The Art of Computer Programming, Sect. 4.2.2","author":"DE Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming, Sect. 4.2.2, 3rd edn. Addison-Wesley, Boston (1997)","edition":"3"},{"key":"16_CR2","unstructured":"Microprocessor Standards Committee of the IEEE Computer Society: IEEE Standard for Floating-Point Arithmetic. IEEE Standard 754 (2008)"},{"key":"16_CR3","unstructured":"The GNU MPFR Library. \n                    http:\/\/www.mpfr.org"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/B978-0-12-505630-4.50012-2","volume-title":"Reliability in Computing, Perspectives in Computing","author":"SM Rump","year":"1988","unstructured":"Rump, S.M.: Algorithms for verified inclusion. In: Moore, R. (ed.) Reliability in Computing, Perspectives in Computing, pp. 109\u2013126. Academic Press, New York (1988)"},{"key":"16_CR5","volume-title":"Introduction to Functional Programming Using Haskell","author":"R Bird","year":"1998","unstructured":"Bird, R.: Introduction to Functional Programming Using Haskell, 2nd edn. Prentice Hall, Englewood Cliffs (1998)","edition":"2"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-540-69611-7_4","volume-title":"Practical Aspects of Declarative Languages","author":"T Morimoto","year":"2007","unstructured":"Morimoto, T., Takano, Y., Iwasaki, H.: Instantly turning a naive exhaustive search into three efficient searches with pruning. In: Hanus, M. (ed.) PADL 2007. LNCS, vol. 4354, pp. 65\u201379. Springer, Heidelberg (2007)"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10990-012-9086-3","volume":"24","author":"H Iwasaki","year":"2011","unstructured":"Iwasaki, H., Morimoto, T., Takano, Y.: Pruning with improving sequences in lazy functional programs. Higher-Order Symbolic Comput. 24, 281\u2013309 (2011)","journal-title":"Higher-Order Symbolic Comput."},{"key":"16_CR8","unstructured":"Lester, D.: ERA: Exact Real Arithmetic, version 1.0 (2000). \n                    http:\/\/hackage.haskell.org\/package\/numbers-3000.2.0.1\/docs\/Data-Number-CReal.html"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45335-0_14","volume-title":"Computability and Complexity in Analysis","author":"NT M\u00fcller","year":"2001","unstructured":"M\u00fcller, N.T.: The iRRAM: exact arithmetic in C++. In: Blank, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol. 2064, p. 222. Springer, Heidelberg (2001)"},{"key":"16_CR10","unstructured":"Haskell wiki, Applications and Libraries \/ Mathematics, Sect. 3.2.2.2. \n                    http:\/\/www.haskell.org\/haskellwiki\/Applications_and_libraries\/Mathematics#Dynamic_precision_by_lazy_evaluation"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/3-540-45335-0_24","volume-title":"Computability and Complexity in Analysis","author":"J Blanck","year":"2001","unstructured":"Blanck, J.: Exact real arithmetic systems: results of competition. In: Blank, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol. 2064, p. 389. Springer, Heidelberg (2001)"},{"key":"16_CR12","unstructured":"Aniya, S., Kitamura, T.: A performance improvement for floating-point arithmetic unit with precision degradation detection. In: The 17th Workshop on Synthesis And System Integration of Mixed Information Technologies (SASIMI 2012), pp. 490\u2013491 (2012)"},{"key":"16_CR13","unstructured":"Jeffrey, K.H., Lam, M.O., Stewart, G.W.: Dynamic floating-point cancellation detection. In: WHIST 2011 (2011)"},{"issue":"6","key":"16_CR14","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/2345156.2254118","volume":"47","author":"Florian Benz","year":"2012","unstructured":"Benz, F., Hildebrandt, A., Hack, S.: A dynamic program analysis to find floating-point accuracy problems. In: SIGPLAN Notices, PLDI 2012, vol. 47, No. 6, pp. 453\u2013462 (2012)","journal-title":"ACM SIGPLAN Notices"},{"issue":"1","key":"16_CR15","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/5960.5962","volume":"12","author":"P Jansen","year":"1986","unstructured":"Jansen, P., Weidner, P.: High-accuracy arithmetic software \u2013 some tests of the ACRITH problem-solving routines. ACM Trans. Math. Softw. 12(1), 62\u201370 (1986)","journal-title":"ACM Trans. Math. Softw."},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-45335-0_3","volume-title":"Computability and Complexity in Analysis","author":"P Gowland","year":"2001","unstructured":"Gowland, P., Lester, D.R.: A survey of exact arithmetic implementations. In: Blank, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol. 2064, pp. 30\u201347. Springer, Heidelberg (2001)"},{"key":"16_CR17","unstructured":"Gosper, W.: Continued fractions (1972). \n                    http:\/\/www.inwap.com\/pdp10\/hbaker\/hakmem\/cf.html"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1109\/12.57047","volume":"39","author":"J Vuillemin","year":"1990","unstructured":"Vuillemin, J.: Exact real computer arithmetic with continued fractions. IEEE Trans. Comput. 39, 1087\u20131105 (1990)","journal-title":"IEEE Trans. Comput."},{"key":"16_CR19","unstructured":"Potts, P.: Exact real arithmetic using M\u00f6bius transformations, Ph.D. thesis, Department of Computing, Imperial College of Science, Technology and Medicine, University of London. \n                    http:\/\/www.doc.ic.ac.uk\/%7Eae\/papers.html"},{"key":"16_CR20","unstructured":"Escard\u00f3, M.: Introduction to exact numerical computation, Notes for a tutorial at ISSAC (2000). \n                    http:\/\/www.cs.bham.ac.uk\/%7Emhe\/issac"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Boehm, H.-J., Cartwright, R., Riggle, M., O\u2019Donnell, M.J.: Exact real arithmetic: a case study in higher order programming. In: ACM Symposium on Lisp and Functional Programming, pp. 162\u2013173 (1986)","DOI":"10.1145\/319838.319860"},{"key":"16_CR22","unstructured":"Guy, M.: bignum \/ BigFloat (2007). \n                    http:\/\/bignum.sourceforge.net\/"},{"key":"16_CR23","unstructured":"Edalat, A.: Exact real number computation using linear fractional transformations, Final Report on EPSRC grant GR\/L43077\/01 (2001)"},{"key":"16_CR24","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1017\/S0960129506005822","volume":"17","author":"B Lambov","year":"2007","unstructured":"Lambov, B.: RealLib: an efficient implementation of exact real arithmetic. Math. Struct. Comput. Sci. 17, 81\u201398 (2007)","journal-title":"Math. Struct. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49498-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T01:05:02Z","timestamp":1584925502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49498-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662494974","9783662494981"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49498-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}