{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T15:07:39Z","timestamp":1774537659722,"version":"3.50.1"},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","issue":"3\/4","license":[{"start":{"date-parts":[[2012,1,23]],"date-time":"2012-01-23T00:00:00Z","timestamp":1327276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2012,1,23]]},"abstract":"<jats:p>This survey will look at SymPy, a free and open source computer algebra system started in 2005 by the second author (O.\u010c.). It is written entirely in Python, available from http:\/\/sympy.org. SymPy is licensed under the \"modified BSD\" license, as is its beautiful logo designed by Fredrik Johansson.<\/jats:p>","DOI":"10.1145\/2110170.2110185","type":"journal-article","created":{"date-parts":[[2012,1,31]],"date-time":"2012-01-31T14:49:20Z","timestamp":1328021360000},"page":"225-234","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":44,"title":["Open source computer algebra systems"],"prefix":"10.1145","volume":"45","author":[{"given":"David","family":"Joyner","sequence":"first","affiliation":[{"name":"US Naval Academy, Annapolis, MD"}]},{"given":"Ond\u0159ej","family":"\u010cert\u00edk","sequence":"additional","affiliation":[{"name":"University of Nevada, Reno"}]},{"given":"Aaron","family":"Meurer","sequence":"additional","affiliation":[{"name":"New Mexico Tech"}]},{"given":"Brian E.","family":"Granger","sequence":"additional","affiliation":[{"name":"California Polytechnic State University, San Luis Obispo, CA"}]}],"member":"320","published-online":{"date-parts":[[2012,1,23]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Quantum Computation, and the Density Operator in SymPy","author":"Cugini Addison","year":"2011","unstructured":"Addison Cugini , Quantum Mechanics , Quantum Computation, and the Density Operator in SymPy , California Polytechnic State University , Senior Thesis , 2011 . http:\/\/digitalcommons.calpoly.edu\/physsp\/38 Addison Cugini, Quantum Mechanics, Quantum Computation, and the Density Operator in SymPy, California Polytechnic State University, Senior Thesis, 2011. http:\/\/digitalcommons.calpoly.edu\/physsp\/38"},{"key":"e_1_2_1_2_1","volume-title":"Symbolic Quantum Circuit Simpliflcation in SymPy","author":"Curry Matthew","year":"2011","unstructured":"Matthew Curry , Symbolic Quantum Circuit Simpliflcation in SymPy , California Polytechnic State University , Senior Thesis , 2011 . http:\/\/digitalcommons.calpoly.edu\/physsp\/39 Matthew Curry, Symbolic Quantum Circuit Simpliflcation in SymPy, California Polytechnic State University, Senior Thesis, 2011. http:\/\/digitalcommons.calpoly.edu\/physsp\/39"},{"key":"e_1_2_1_3_1","unstructured":"Aaron Meurer Variation of Parameters and More blog post available at http:\/\/asmeurersympy.wordpress.com\/2009\/08\/01\/variation-of-parameters-and-more\/.  Aaron Meurer Variation of Parameters and More blog post available at http:\/\/asmeurersympy.wordpress.com\/2009\/08\/01\/variation-of-parameters-and-more\/."},{"key":"e_1_2_1_4_1","volume-title":"Dynamically Typed Programming Language","author":"Paprocki Mateusz","year":"2010","unstructured":"Mateusz Paprocki , Design and Implementation Issues of a Computer Algebra System in an Interpreted , Dynamically Typed Programming Language , Master's Thesis, 2010 , University of Technology of Wroclaw , Poland. https:\/\/github.com\/mattpap\/masters-thesis http:\/\/mattpap.github.com\/masters-thesis\/html\/index.html Mateusz Paprocki, Design and Implementation Issues of a Computer Algebra System in an Interpreted, Dynamically Typed Programming Language, Master's Thesis, 2010, University of Technology of Wroclaw, Poland. https:\/\/github.com\/mattpap\/masters-thesis http:\/\/mattpap.github.com\/masters-thesis\/html\/index.html"},{"key":"e_1_2_1_5_1","volume-title":"SciPy conference 2011 presentation, http:\/\/mattpap.github.com\/scipy-2011-tutorial\/html\/mathematics.html","author":"Paprocki Mateusz","unstructured":"Mateusz Paprocki and Aaron Meurer , Guide to symbolic mathematics with SymPy , SciPy conference 2011 presentation, http:\/\/mattpap.github.com\/scipy-2011-tutorial\/html\/mathematics.html Mateusz Paprocki and Aaron Meurer, Guide to symbolic mathematics with SymPy, SciPy conference 2011 presentation, http:\/\/mattpap.github.com\/scipy-2011-tutorial\/html\/mathematics.html"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0370-2693(96)00439-X"},{"key":"e_1_2_1_7_1","unstructured":"SymPy website. http:\/\/www.sympy.org\/  SymPy website. http:\/\/www.sympy.org\/"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2110170.2110185","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2110170.2110185","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:39Z","timestamp":1750249419000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2110170.2110185"}},"subtitle":["SymPy"],"short-title":[],"issued":{"date-parts":[[2012,1,23]]},"references-count":7,"journal-issue":{"issue":"3\/4","published-print":{"date-parts":[[2012,1,23]]}},"alternative-id":["10.1145\/2110170.2110185"],"URL":"https:\/\/doi.org\/10.1145\/2110170.2110185","relation":{},"ISSN":["1932-2240"],"issn-type":[{"value":"1932-2240","type":"print"}],"subject":[],"published":{"date-parts":[[2012,1,23]]},"assertion":[{"value":"2012-01-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}