{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T16:17:42Z","timestamp":1747153062629,"version":"3.40.5"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030810962"},{"type":"electronic","value":"9783030810979"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-81097-9_18","type":"book-chapter","created":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T23:04:38Z","timestamp":1626735878000},"page":"211-227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Language with Type-Dependent Equality"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3040-3655","authenticated-orcid":false,"given":"Florian","family":"Rabe","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,20]]},"reference":[{"issue":"4","key":"18_CR1","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.jal.2005.10.005","volume":"4","author":"S Allen","year":"2006","unstructured":"Allen, S., et al.: Innovations in computational type theory using nuprl. J. Appl. Log. 4(4), 428\u2013469 (2006)","journal-title":"J. Appl. Log."},{"key":"18_CR2","unstructured":"Allen, S.: A Non-type-theoretic Semantics for Type-theoretic Language. Ph.D. thesis, Cornell University (1987)"},{"key":"18_CR3","unstructured":"Constable, R., et al.: Implementing Mathematics with the Nuprl Development System. Prentice-Hall (1986)"},{"key":"18_CR4","volume-title":"The Coq Proof Assistant: Reference Manual","author":"Coq Development Team","year":"2015","unstructured":"Coq Development Team: The Coq Proof Assistant: Reference Manual. Technical report, INRIA (2015)"},{"key":"18_CR5","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":"18_CR6","doi-asserted-by":"crossref","unstructured":"Gordon, M.: HOL: a proof generating system for higher-order logic. In: Birtwistle, G., Subrahmanyam, P. (eds.) VLSI Specification, Verification and Synthesis, pp. 73\u2013128. Kluwer-Academic Publishers (1988)","DOI":"10.1007\/978-1-4613-2007-4_3"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-030-53518-6_9","volume-title":"Intelligent Computer Mathematics","author":"C Kaliszyk","year":"2020","unstructured":"Kaliszyk, C., Rabe, F.: A survey of languages for formalizing mathematics. In: Benzm\u00fcller, C., Miller, B. (eds.) CICM 2020. LNCS (LNAI), vol. 12236, pp. 138\u2013156. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53518-6_9"},{"issue":"3","key":"18_CR8","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1145\/1358190.1358201","volume":"41","author":"S Linton","year":"2007","unstructured":"Linton, S.: GAP: groups, algorithms, programming. ACM Commun. Comput. Algebra 41(3), 108\u2013109 (2007)","journal-title":"ACM Commun. Comput. Algebra"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-45685-6_18","volume-title":"Theorem Proving in Higher Order Logics","author":"A Nogin","year":"2002","unstructured":"Nogin, A.: Quotient types: a modular approach. In: Carre\u00f1o, V.A., Mu\u00f1oz, C.A., Tahar, S. (eds.) TPHOLs 2002. LNCS, vol. 2410, pp. 263\u2013280. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45685-6_18"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Owre, S., Rushby, J., Shankar. N.: PVS: a prototype verification system. In: Kapur, D. (eds.) 11th International Conference on Automated Deduction (CADE), pp. 748\u2013752. Springer (1992)","DOI":"10.1007\/3-540-55602-8_217"},{"key":"18_CR11","unstructured":"Paulson, L., Coen, M.: Zermelo-Fraenkel Set Theory, 1993. Isabelle distribution, ZF\/ZF.thy"},{"key":"18_CR12","unstructured":"Stein, W., et al.: Sage Mathematics Software. The Sage Development Team (2013). http:\/\/www.sagemath.org"},{"key":"18_CR13","unstructured":"Trybulec, A., Blair, H.: Computer assisted reasoning with MIZAR. In: Joshi, A., (eds.) Proceedings of the 9th International Joint Conference on Artificial Intelligence, pp. 26\u201328. Morgan Kaufmann (1985)"},{"key":"18_CR14","unstructured":"Wiedijk, F.: The QED manifesto revisited. In: From Insight to Proof, Festschrift in Honour of Andrzej Trybulec, pp. 121\u2013133 (2007)"}],"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-030-81097-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T23:08:32Z","timestamp":1626736112000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81097-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030810962","9783030810979"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81097-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 July 2021","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":"Timisoara","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Romania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mkm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cicm-conference.org\/2021\/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":"38","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":"12","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":"8","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":"32% - 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,5","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)"}}]}}