{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T19:43:41Z","timestamp":1726083821318},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030471460"},{"type":"electronic","value":"9783030471477"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-47147-7_1","type":"book-chapter","created":{"date-parts":[[2020,5,10]],"date-time":"2020-05-10T23:02:55Z","timestamp":1589151775000},"page":"1-20","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Quotients by Idempotent Functions in Cedille"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Marmaduke","sequence":"first","affiliation":[]},{"given":"Christopher","family":"Jenkins","sequence":"additional","affiliation":[]},{"given":"Aaron","family":"Stump","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,11]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Altenkirch, T., Kaposi, A.: Type theory in type theory using quotient inductive types. In: Proceedings of the 43rd Annual ACMSIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, vol. 51, pp. 18\u201329. ACM (2016)","DOI":"10.1145\/2914770.2837638"},{"key":"1_CR2","unstructured":"Anand, A., Bickford, M., Constable, R.L., Rahli, V.: A type theory with partial equivalence relations as types. In: 20th International Conference on Types for Proofs and Programs (2014)"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/3-540-39185-1_6","volume-title":"Types for Proofs and Programs","author":"L Chicli","year":"2003","unstructured":"Chicli, L., Pottier, L., Simpson, C.: Mathematical quotients and quotient types in Coq. In: Geuvers, H., Wiedijk, F. (eds.) TYPES 2002. LNCS, vol. 2646, pp. 95\u2013107. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/3-540-39185-1_6"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-39634-2_17","volume-title":"Interactive Theorem Proving","author":"C Cohen","year":"2013","unstructured":"Cohen, C.: Pragmatic quotient types in Coq. In: Blazy, S., Paulin-Mohring, C., Pichardie, D. (eds.) ITP 2013. LNCS, vol. 7998, pp. 213\u2013228. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-39634-2_17"},{"key":"1_CR5","unstructured":"Coquand, T., Huet, G.: The calculus of constructions. Ph.D. thesis, INRIA (1986)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/3-540-44802-0_39","volume-title":"Computer Science Logic","author":"P Courtieu","year":"2001","unstructured":"Courtieu, P.: Normalized types. In: Fribourg, L. (ed.) CSL 2001. LNCS, vol. 2142, pp. 554\u2013569. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-44802-0_39"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-94821-8_14","volume-title":"Interactive Theorem Proving","author":"D Firsov","year":"2018","unstructured":"Firsov, D., Blair, R., Stump, A.: Efficient mendler-style lambda-encodings in cedille. In: Avigad, J., Mahboubi, A. (eds.) ITP 2018. LNCS, vol. 10895, pp. 235\u2013252. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-94821-8_14"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Frumin, D., Geuvers, H., Gondelman, L., Weide, N.V.D.: Finite sets in homotopy type theory. In: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, pp. 201\u2013214. ACM (2018)","DOI":"10.1145\/3167085"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-03359-9_23","volume-title":"Theorem Proving in Higher Order Logics","author":"F Garillot","year":"2009","unstructured":"Garillot, F., Gonthier, G., Mahboubi, A., Rideau, L.: Packaging mathematical structures. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 327\u2013342. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03359-9_23"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-60579-7_3","volume-title":"Types for Proofs and Programs","author":"E Gim\u00e9nez","year":"1995","unstructured":"Gim\u00e9nez, E.: Codifying guarded definitions with recursive schemes. In: Dybjer, P., Nordstr\u00f6m, B., Smith, J. (eds.) TYPES 1994. LNCS, vol. 996, pp. 39\u201359. Springer, Heidelberg (1995). \nhttps:\/\/doi.org\/10.1007\/3-540-60579-7_3"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/BFb0014055","volume-title":"Typed Lambda Calculi and Applications","author":"M Hofmann","year":"1995","unstructured":"Hofmann, M.: A simple model for quotient types. In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol. 902, pp. 216\u2013234. Springer, Heidelberg (1995). \nhttps:\/\/doi.org\/10.1007\/BFb0014055"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/11541868_9","volume-title":"Theorem Proving in Higher Order Logics","author":"PV Homeier","year":"2005","unstructured":"Homeier, P.V.: A design structure for higher order quotients. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol. 3603, pp. 130\u2013146. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11541868_9"},{"key":"1_CR13","unstructured":"Jenkins, C., McDonald, C., Stump, A.: Elaborating inductive datatypes and course-of-values pattern matching to Cedille. CoRR (2019). \nhttp:\/\/arxiv.org\/abs\/1903.08233"},{"key":"1_CR14","unstructured":"Kopylov, A.: Dependent intersection: a new way of defining records in type theory. In: Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, LICS 2003. IEEE Computer Society, Washington, DC (2003)"},{"key":"1_CR15","unstructured":"Li, N.: Quotient types in type theory. Ph.D. thesis, University of Nottingham (2015)"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-48167-2_12","volume-title":"Types for Proofs and Programs","author":"ME Maietti","year":"1999","unstructured":"Maietti, M.E.: About effective quotients in constructive type theory. In: Altenkirch, T., Reus, B., Naraschewski, W. (eds.) TYPES 1998. LNCS, vol. 1657, pp. 166\u2013178. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48167-2_12"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-45842-5_13","volume-title":"Types for Proofs and Programs","author":"C McBride","year":"2002","unstructured":"McBride, C.: Elimination with a motive. In: Callaghan, P., Luo, Z., McKinna, J., Pollack, R., Pollack, R. (eds.) TYPES 2000. LNCS, vol. 2277, pp. 197\u2013216. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-45842-5_13"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/3-540-45413-6_27","volume-title":"Typed Lambda Calculi and Applications","author":"A Miquel","year":"2001","unstructured":"Miquel, A.: The implicit calculus of constructions extending pure type systems with an intersection type binder and subtyping. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol. 2044, pp. 344\u2013359. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-45413-6_27"},{"key":"1_CR19","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). \nhttps:\/\/doi.org\/10.1007\/3-540-45685-6_18"},{"key":"1_CR20","unstructured":"Pinyo, G., Altenkirch, T.: Integers as a higher inductive type. In: 24th International Conference on Types for Proofs and Programs (2018)"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"e14","DOI":"10.1017\/S0956796817000053","volume":"27","author":"A Stump","year":"2017","unstructured":"Stump, A.: The calculus of dependent lambda eliminations. J. Funct. Program. 27, e14 (2017)","journal-title":"J. Funct. Program."},{"key":"1_CR22","unstructured":"Stump, A.: Syntax and semantics of Cedille (2018). \nhttps:\/\/arxiv.org\/abs\/1806.04709"},{"key":"1_CR23","unstructured":"Veltri, N.: Two set-based implementations of quotients in type theory. In: Proceedings of the 14th Symposium on Programming Languages and Software Tools, pp. 194\u2013205 (2015)"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Vezzosi, A., M\u00f6rtberg, A., Abel, A.: Cubical agda: a dependently typed programming language with univalence and higher inductive types, vol. 3, p. 87. ACM (2019)","DOI":"10.1145\/3341691"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"van der Weide, N., Geuvers, H.: The construction of set-truncated higher inductive types. In: Thirty-Fifth Conference on the Mathematical Foundations of Programming Semantics (2019)","DOI":"10.1016\/j.entcs.2019.09.014"}],"container-title":["Lecture Notes in Computer Science","Trends in Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-47147-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,10]],"date-time":"2020-05-10T23:09:13Z","timestamp":1589152153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-47147-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030471460","9783030471477"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-47147-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"11 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TFP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Trends in Functional Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vancouver, BC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tfp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.tfp2019.org\/","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.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","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":"6","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":"0","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":"55% - 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":"2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}