{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:27:57Z","timestamp":1743139677848,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031427527"},{"type":"electronic","value":"9783031427534"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-42753-4_24","type":"book-chapter","created":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T06:02:35Z","timestamp":1693375355000},"page":"315-320","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extracting Theory Graphs from Aldor Libraries"],"prefix":"10.1007","author":[{"given":"Florian","family":"Rabe","sequence":"first","affiliation":[]},{"given":"Stephen M.","family":"Watt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,28]]},"reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/3-540-61697-7_2","volume-title":"Design and Implementation of Symbolic Computation Systems","author":"M Bronstein","year":"1996","unstructured":"Bronstein, M.: $$\\sum ^{IT}$$\u2014a strongly-typed embeddable computer algebra library. In: Calmet, J., Limongelli, C. (eds.) DISCO 1996. LNCS, vol. 1128, pp. 22\u201333. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61697-7_2"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/3-540-55602-8_192","volume-title":"Automated Deduction\u2014CADE-11","author":"WM Farmer","year":"1992","unstructured":"Farmer, W.M., Guttman, J.D., Javier Thayer, F.: Little theories. In: Kapur, D. (ed.) CADE 1992. LNCS, vol. 607, pp. 567\u2013581. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55602-8_192"},{"issue":"11","key":"24_CR3","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/988125.988127","volume":"16","author":"RD Jenks","year":"1981","unstructured":"Jenks, R.D., Trager, B.M.: A language for computational algebra. ACM SIGPLAN Not. 16(11), 22\u201329 (1981)","journal-title":"ACM SIGPLAN Not."},{"issue":"8","key":"24_CR4","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1007\/s10817-021-09604-0","volume":"65","author":"M Kohlhase","year":"2021","unstructured":"Kohlhase, M., Rabe, F.: Experiences from exporting major proof assistant libraries. J. Autom. Reason. 65(8), 1265\u20131298 (2021)","journal-title":"J. Autom. Reason."},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-319-94205-6_38","volume-title":"Automated Reasoning","author":"D M\u00fcller","year":"2018","unstructured":"M\u00fcller, D., Rabe, F., Kohlhase, M.: Theories as types. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds.) IJCAR 2018. LNCS (LNAI), vol. 10900, pp. 575\u2013590. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94205-6_38"},{"issue":"1","key":"24_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2013.06.001","volume":"230","author":"F Rabe","year":"2013","unstructured":"Rabe, F., Kohlhase, M.: A scalable module system. Inf. Comput. 230(1), 1\u201354 (2013)","journal-title":"Inf. Comput."},{"key":"24_CR7","doi-asserted-by":"publisher","unstructured":"S.M. Watt. Handbook of Computer Algebra, chapter 4.1.3 Aldor, pp. 265\u2013270. Springer, Cham (2003). https:\/\/doi.org\/10.1007\/978-3-642-55826-9_4","DOI":"10.1007\/978-3-642-55826-9_4"},{"key":"24_CR8","unstructured":"Watt, S.M.: Post facto type extension for mathematical programming. In: Proceedings of Domain-Specific Aspect Languages, pp. 26\u201331. SIGPLAN, ACM, October 2006"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Watt, S.M., Broadbery, P.A., Dooley, S.S., Iglio, P., Steinbach, J.M., Sutor, R.S.: A first report on the $$A^\\sharp $$ compiler. In: Proceedings of ISSAC, pp. 25\u201331. ACM, July 1994","DOI":"10.1145\/190347.190356"}],"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-42753-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T06:04:54Z","timestamp":1693375494000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-42753-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031427527","9783031427534"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-42753-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 August 2023","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":"Cambridge","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mkm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cicm-conference.org\/2023\/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":"31","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":"16","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":"6","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":"52% - 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":"3","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","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)"}}]}}