{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T19:43:49Z","timestamp":1776887029727,"version":"3.51.2"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031166808","type":"print"},{"value":"9783031166815","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16681-5_8","type":"book-chapter","created":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T03:41:24Z","timestamp":1663299684000},"page":"122-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Graded Rings in\u00a0Lean\u2019s Dependent Type Theory"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0412-4978","authenticated-orcid":false,"given":"Eric","family":"Wieser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7340-2703","authenticated-orcid":false,"given":"Jujian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,17]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-51054-1_1","volume-title":"Automated Reasoning","author":"R Affeldt","year":"2020","unstructured":"Affeldt, R., Cohen, C., Kerjean, M., Mahboubi, A., Rouhling, D., Sakaguchi, K.: Competing inheritance paths in\u00a0dependent type theory: a case study in functional analysis. In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNCS (LNAI), vol. 12167, pp. 3\u201320. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51054-1_1"},{"key":"8_CR2","unstructured":"Avigad, J., et al.: Spectral Sequences in Homotopy Type Theory, November 2015. https:\/\/github.com\/cmu-phil\/Spectral"},{"key":"8_CR3","unstructured":"Baanen, A.: Leanprover-community\/mathlib#11750: define subobject classes from submonoid up to subfield, April 2022. https:\/\/github.com\/leanprover-community\/mathlib\/pull\/11750"},{"key":"8_CR4","unstructured":"Baanen, A.: Use and abuse of instance parameters in the Lean mathematical library. In: ITP 2022, Haifa, Israel, May 2022. http:\/\/arxiv.org\/abs\/2202.01629"},{"key":"8_CR5","unstructured":"Barton, R., Commelin, J., Buzzard, K., Lau, K., Carneiro, M.: #maths $$>$$ CDGAs, June 2019. https:\/\/leanprover-community.github.io\/archive\/stream\/116395-maths\/topic\/CDGAs.html"},{"key":"8_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59312-3","volume-title":"Algebra I, Chapters 1\u20133. Elements of Mathematics","author":"N Bourbaki","year":"1989","unstructured":"Bourbaki, N.: Algebra I, Chapters 1\u20133. Elements of Mathematics. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/978-3-642-59312-3"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Brunerie, G., Ljungstr\u00f6m, A., M\u00f6rtberg, A.: Synthetic integral cohomology in cubical agda. In: Manea, F., Simpson, A. (eds.) 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol. 216, pp. 11:1\u201311:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2022). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2022.11. ISSN: 1868-8969","DOI":"10.4230\/LIPIcs.CSL.2022.11"},{"issue":"7865","key":"8_CR8","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1038\/d41586-021-01627-2","volume":"595","author":"D Castelvecchi","year":"2021","unstructured":"Castelvecchi, D.: Mathematicians welcome computer-assisted proof in \u2018grand unification\u2019 theory. Nature 595(7865), 18\u201319 (2021). https:\/\/doi.org\/10.1038\/d41586-021-01627-2","journal-title":"Nature"},{"issue":"11","key":"8_CR9","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1016\/j.tcs.2010.11.016","volume":"412","author":"C Dom\u00ednguez","year":"2011","unstructured":"Dom\u00ednguez, C., Rubio, J.: Effective homology of bicomplexes, formalized in Coq. Theoret. Comput. Sci. 412(11), 962\u2013970 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2010.11.016","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-319-21401-6_26","volume-title":"Automated Deduction - CADE-25","author":"L de Moura","year":"2015","unstructured":"de Moura, L., Kong, S., Avigad, J., van Doorn, F., von Raumer, J.: The lean theorem prover (system description). In: Felty, A.P., Middeldorp, A. (eds.) CADE 2015. LNCS (LNAI), vol. 9195, pp. 378\u2013388. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21401-6_26"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"The mathlib Community: The lean mathematical library. In: Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, pp. 367\u2013381. ACM, New Orleans, January 2020. https:\/\/doi.org\/10.1145\/3372885.3373824","DOI":"10.1145\/3372885.3373824"},{"key":"8_CR12","unstructured":"The Stacks project authors: The Stacks project (2022). https:\/\/stacks.math.columbia.edu"},{"key":"8_CR13","unstructured":"Wieser, E.: Scalar actions in Lean\u2019s mathlib. In: CICM 2021. Timisoara, Romania, August 2021. http:\/\/arxiv.org\/abs\/2108.10700"},{"issue":"3","key":"8_CR14","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s00006-021-01164-1","volume":"32","author":"E Wieser","year":"2022","unstructured":"Wieser, E., Song, U.: Formalizing geometric algebra in lean. Adv. Appl. Clifford Algebras 32(3), 28 (2022). https:\/\/doi.org\/10.1007\/s00006-021-01164-1","journal-title":"Adv. Appl. Clifford Algebras"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16681-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T03:42:14Z","timestamp":1663299734000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16681-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031166808","9783031166815"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16681-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"17 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CICM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computer Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tbilisi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mkm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cicm-conference.org\/2022\/cicm.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.95","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}