Andrew Adams, Martin Dunstan, Hanne Gottliebsen, Tom Kelsey, Ursula Martin & Sam Owre (2001):
Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS.
In: Richard J. Boulton & Paul B. Jackson: Theorem Proving in Higher Order Logics, TPHOLs 2001,
Lecture Notes in Computer Science 2152.
Springer-Verlag,
Edinburgh, Scotland,
pp. 27–42,
doi:10.1007/3-540-44755-5_4.
Behzad Akbarpour & Lawrence Charles Paulson (2010):
MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions.
Journal of Automated Reasoning 44,
pp. 175–205,
doi:10.1007/s10817-009-9149-2.
R. Gamboa & M. Kaufmann (2001):
Nonstandard analysis in ACL2.
Journal of Automated Reasoning 27(4),
pp. 323–351,
doi:10.1023/A:1011908113514.
J. Harrison (1996):
Theorem Proving with the Real Numbers.
University of Cambridge.
Cezary Kaliszyk & Freek Wiedijk (2007):
Certified Computer Algebra on Top of an Interactive Theorem Prover.
In: Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference,
Calculemus '07 / MKM '07.
Springer-Verlag,
Berlin, Heidelberg,
pp. 94–105,
doi:10.1007/978-3-540-73086-6_8.
M. Kaufmann & J S. Moore (1997):
An Industrial Strength Theorem Prover for a Logic Based on Common Lisp.
IEEE Transactions on Software Engineering 23(4),
pp. 203–213,
doi:10.1109/32.588534.
David McMahon (2008):
Quantum Computing Explained.
Wiley & Sons.
Umesh V. Vazirani (2012):
Course Notes for Quantum Mechanics and Quantum Computation.
https://www.edx.org/courses/BerkeleyX/CS191x/2013_Spring/about, previously on www.coursera.org.
Noson S. Yanofsky & Mirco A. Mannucci (2008):
Quantum Computing for Computer Scientists.
Cambridge University Press,
doi:10.1017/CBO9780511813887.