References

  1. Milton Abramowitz & Irene A Stegun (1964): Handbook of mathematical functions: with formulas, graphs, and mathematical tables 55. Courier Corporation.
  2. N. I. Adams, IV, D. H. Bartley, G. Brooks, R. K. Dybvig, D. P. Friedman, R. Halstead, C. Hanson, C. T. Haynes, E. Kohlbecker, D. Oxley, K. M. Pitman, G. J. Rozas, G. L. Steele, Jr., G. J. Sussman, M. Wand & H. Abelson (1998): Revised^5 report on the algorithmic language scheme. SIGPLAN Not. 33(9), pp. 26–76, doi:10.1145/290229.290234.
  3. Carl B Boyer & Uta C Merzbach (2011): A history of mathematics. John Wiley & Sons.
  4. Aditya Deshpande & Jeff Draper (2010): Squaring units and a comparison with multipliers. In: Circuits and Systems (MWSCAS), 2010 53rd IEEE International Midwest Symposium on. IEEE, pp. 1266–1269, doi:10.1109/MWSCAS.2010.5548763.
  5. Shmuel Gal (1986): Computing elementary functions: A new approach for achieving high accuracy and good performance. In: Accurate Scientific Computations. Springer, pp. 1–16, doi:10.1007/3-540-16798-6_1.
  6. Martin Guy (1985): sqrt.c. Internet. Available at http://medialab.freaknet.org/martin/src/sqrt/sqrt.c.
  7. Lars T Hansen (2000): SRFI 11: Syntax for receiving multiple values. Internet. Available at http://srfi.schemers.org/srfi-11.
  8. Oleg Kiselyov (2002): How to write seemingly unhygienic and referentially opaque macros with syntax-rules. In: Scheme Workshop.
  9. Oleg Kiselyov (2002): Macros That Compose: Systematic Macro Programming. In: GPCE, pp. 202–217. Available at http://dx.doi.org/10.1007/3-540-45821-2_13.
  10. Oleg Kiselyov, William E Byrd, Daniel P Friedman & Chung-chieh Shan (2008): Pure, declarative, and constructive arithmetic relations (declarative pearl). In: International Symposium on Functional and Logic Programming. Springer, pp. 64–80, doi:10.1007/978-3-540-78969-7_7.
  11. Peter Kourzanov (2015): anaphora. Internet. Available at https://github.com/kourzanov/anaphora.
  12. Peter Kourzanov (2015): The art of an anaphoric macro. In: IFL. Available at https://drive.google.com/drive/folders/0Bymk40gLRGHkZEZxRGwwd05Wd0E.
  13. David Kushner (2002): The wizardry of id [video games]. IEEE Spectrum 39(8), pp. 42–47, doi:10.1109/MSPEC.2002.1021943.
  14. M Nikulin (2001): Hazewinkel, Michiel, Encyclopaedia of mathematics: an updated and annotated translation of the Soviet Mathematical encyclopaedia.
  15. John C. Reynolds (1972): Definitional Interpreters for Higher-order Programming Languages. In: Proceedings of the ACM Annual Conference - Volume 2, ACM '72. ACM, New York, NY, USA, pp. 717–740, doi:10.1145/800194.805852.
  16. Leslie D Servi (2003): Nested square roots of 2. The American mathematical monthly 110(4), pp. 326–330, doi:10.1080/00029890.2003.11919968.
  17. Kabiraj Sethi & Rutuparna Panda (2015): Multiplier less high-speed squaring circuit for binary numbers. International Journal of Electronics 102(3), pp. 433–443, doi:10.1080/00207217.2014.897381. ArXiv:http://dx.doi.org/10.1080/00207217.2014.897381.
  18. J Volder (1956): Binary computation algorithms for coordinate rotation and function generation. Convair Report IAR-1 148, pp. 17.
  19. Jack E Volder (2000): The birth of CORDIC. Journal of VLSI signal processing systems for signal, image and video technology 25(2), pp. 101–105, doi:10.1023/A:1008110704586.
  20. Stephen Wolfram (2017): Trigonometric Identities. Internet. Available at http://mathworld.wolfram.com/topics/TrigonometricIdentities.html.
  21. C.C Woo (1922): The Fundamental Operations in Bead Arithmetic. How to Use the Chinese Abacus.
  22. Seth Zimmerman & Chungwu Ho (2008): On infinitely nested radicals. Mathematics Magazine 81(1), pp. 3–15, doi:10.1080/0025570X.2008.11953522.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org