{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:08:12Z","timestamp":1742922492441,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031389375"},{"type":"electronic","value":"9783031389382"}],"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-38938-2_1","type":"book-chapter","created":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T11:01:49Z","timestamp":1693134109000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Impredicative Encodings of\u00a0Inductive-Inductive Data in\u00a0Cedille"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Marmaduke","sequence":"first","affiliation":[]},{"given":"Larry","family":"Diehl","sequence":"additional","affiliation":[]},{"given":"Aaron","family":"Stump","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,28]]},"reference":[{"issue":"4","key":"1_CR1","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.jal.2005.10.005","volume":"4","author":"SF Allen","year":"2006","unstructured":"Allen, S.F., Bickford, M., Constable, R.L., Eaton, R., Kreitz, C., Lorigo, L., Moran, E.: Innovations in computational type theory using nuprl. J. Appl. Logic 4(4), 428\u2013469 (2006)","journal-title":"J. Appl. Logic"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-319-89366-2_16","volume-title":"Foundations of Software Science and Computation Structures","author":"T Altenkirch","year":"2018","unstructured":"Altenkirch, T., Capriotti, P., Dijkstra, G., Kraus, N., Nordvall Forsberg, F.: Quotient inductive-inductive types. In: Baier, C., Dal Lago, U. (eds.) FoSSaCS 2018. LNCS, vol. 10803, pp. 293\u2013310. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89366-2_16"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-22944-2_6","volume-title":"Algebra and Coalgebra in Computer Science","author":"T Altenkirch","year":"2011","unstructured":"Altenkirch, T., Morris, P., Nordvall Forsberg, F., Setzer, A.: A categorical semantics for inductive-inductive definitions. In: Corradini, A., Klin, B., C\u00eerstea, C. (eds.) CALCO 2011. LNCS, vol. 6859, pp. 70\u201384. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22944-2_6"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Atkey, R.: Syntax and semantics of quantitative type theory. In: Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science, pp. 56\u201365 (2018)","DOI":"10.1145\/3209108.3209189"},{"key":"1_CR5","unstructured":"Dijkstra, G.: Quotient inductive-inductive definitions. Ph.D. thesis, University of Nottingham (2017)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-48959-2_11","volume-title":"Typed Lambda Calculi and Applications","author":"P Dybjer","year":"1999","unstructured":"Dybjer, P., Setzer, A.: A finite axiomatization of inductive-recursive definitions. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol. 1581, pp. 129\u2013146. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48959-2_11"},{"issue":"1\u20133","key":"1_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0168-0072(02)00096-9","volume":"124","author":"P Dybjer","year":"2003","unstructured":"Dybjer, P., Setzer, A.: Induction-recursion and initial algebras. Ann. Pure Appl. Logic 124(1\u20133), 1\u201347 (2003)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jlap.2005.07.001","volume":"66","author":"P Dybjer","year":"2006","unstructured":"Dybjer, P., Setzer, A.: Indexed induction-recursion. J. Logic Algebr. Program. 66(1), 1\u201349 (2006)","journal-title":"J. Logic Algebr. Program."},{"key":"1_CR9","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). https:\/\/doi.org\/10.1007\/978-3-319-94821-8_14"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Firsov, D., Blair, R., Stump, A.: Efficient mendler-style lambda-encodings in cedille. In: Interactive Theorem Proving: 9th International Conference, ITP 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, 9\u201312 July 2018, Proceedings 9, pp. 235\u2013252. Springer (2018)","DOI":"10.1007\/978-3-319-94821-8_14"},{"key":"1_CR11","unstructured":"Forsberg, F.N.: Inductive-inductive definitions. Ph.D. thesis, Swansea University (2013). http:\/\/login.proxy.lib.uiowa.edu\/login?url=https:\/\/www.proquest.com\/dissertations-theses\/inductive-definitions\/docview\/2041902169\/se-2 copyright - Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works. Accessed 21 Oct 2022"},{"key":"1_CR12","first-page":"259","volume":"3","author":"FN Forsberg","year":"2012","unstructured":"Forsberg, F.N., Setzer, A.: A finite axiomatisation of inductive-inductive definitions. Logic Constr. Comput. 3, 259\u2013287 (2012)","journal-title":"Logic Constr. Comput."},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-45413-6_16","volume-title":"Typed Lambda Calculi and Applications","author":"H Geuvers","year":"2001","unstructured":"Geuvers, H.: Induction is not derivable in second order dependent type theory. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol. 2044, pp. 166\u2013181. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45413-6_16"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-38946-7_13","volume-title":"Typed Lambda Calculi and Applications","author":"P Hancock","year":"2013","unstructured":"Hancock, P., McBride, C., Ghani, N., Malatesta, L., Altenkirch, T.: Small induction recursion. In: Hasegawa, M. (ed.) TLCA 2013. LNCS, vol. 7941, pp. 156\u2013172. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38946-7_13"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Jenkins, C., Marmaduke, A., Stump, A.: Simulating large eliminations in cedille. In: Basold, H., Cockx, J., Ghilezan, S. (eds.) 27th International Conference on Types for Proofs and Programs (TYPES 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 239, pp. 9:1\u20139:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2022). https:\/\/doi.org\/10.4230\/LIPIcs.TYPES.2021.9,https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2022\/16778","DOI":"10.4230\/LIPIcs.TYPES.2021.9"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Kaposi, A., Kov\u00e1cs, A., Altenkirch, T.: Constructing quotient inductive-inductive types. Proc. ACM Program. Lang. 3(POPL), 1\u201324 (2019)","DOI":"10.1145\/3290315"},{"key":"1_CR17","unstructured":"Kaposi, A., Kov\u00e1cs, A., Lafont, A.: For finitary induction-induction, induction is enough. In: TYPES 2019: 25th International Conference on Types for Proofs and Programs, vol. 175, pp. 6\u20131. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"1_CR18","unstructured":"Kaposi, A., von Raumer, J.: A syntax for mutual inductive families (2020)"},{"key":"1_CR19","doi-asserted-by":"crossref","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, pp. 86\u201395.IEEE Computer Society, Washington, DC (2003)","DOI":"10.1109\/LICS.2003.1210048"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-47147-7_1","volume-title":"Trends in Functional Programming","author":"A Marmaduke","year":"2020","unstructured":"Marmaduke, A., Jenkins, C., Stump, A.: Quotients by idempotent functions in cedille. In: Bowman, W.J., Garcia, R. (eds.) TFP 2019. LNCS, vol. 12053, pp. 1\u201320. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-47147-7_1"},{"key":"1_CR21","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). https:\/\/doi.org\/10.1007\/3-540-45413-6_27"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-642-15205-4_35","volume-title":"Computer Science Logic","author":"F Nordvall Forsberg","year":"2010","unstructured":"Nordvall Forsberg, F., Setzer, A.: Inductive-inductive definitions. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol. 6247, pp. 454\u2013468. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15205-4_35"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-19027-9_10","volume-title":"ESOP \u201988","author":"M Parigot","year":"1988","unstructured":"Parigot, M.: Programming with proofs: a second order type theory. In: Ganzinger, H. (ed.) ESOP 1988. LNCS, vol. 300, pp. 145\u2013159. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-19027-9_10"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/3-540-52753-2_47","volume-title":"CSL \u201989","author":"M Parigot","year":"1990","unstructured":"Parigot, M.: On the representation of data in lambda-calculus. In: B\u00f6rger, E., B\u00fcning, H.K., Richter, M.M. (eds.) CSL 1989. LNCS, vol. 440, pp. 309\u2013321. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-52753-2_47"},{"key":"1_CR25","doi-asserted-by":"publisher","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."},{"issue":"7","key":"1_CR26","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.apal.2018.03.002","volume":"169","author":"A Stump","year":"2018","unstructured":"Stump, A.: From realizability to induction via dependent intersection. Ann. Pure Appl. Logic 169(7), 637\u2013655 (2018). https:\/\/doi.org\/10.1016\/j.apal.2018.03.002","journal-title":"Ann. Pure Appl. Logic"}],"container-title":["Lecture Notes in Computer Science","Trends in Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38938-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T22:35:52Z","timestamp":1729982152000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38938-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031389375","9783031389382"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38938-2_1","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":"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":"Boston, MA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"12 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tfp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/trendsfp.github.io\/index.html","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":"14","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":"43% - 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)"}}]}}