{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T14:10:22Z","timestamp":1765116622655,"version":"3.46.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031995354"},{"type":"electronic","value":"9783031995361"}],"license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"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":[[2026]]},"DOI":"10.1007\/978-3-031-99536-1_2","type":"book-chapter","created":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T10:54:20Z","timestamp":1753959260000},"page":"21-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Deep Induction for\u00a0Inductive Families"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8075-3904","authenticated-orcid":false,"given":"Patricia","family":"Johann","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9008-4660","authenticated-orcid":false,"given":"Edward","family":"Morehouse","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,1]]},"reference":[{"key":"2_CR1","unstructured":"The Agda Wiki. https:\/\/wiki.portal.chalmers.se\/agda\/pmwiki.php"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0054285","volume-title":"Mathematics of Program Construction","author":"R Bird","year":"1998","unstructured":"Bird, R., Meertens, L.: Nested datatypes. In: Jeuring, J. (ed.) MPC 1998. LNCS, vol. 1422, pp. 52\u201367. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054285"},{"key":"2_CR3","unstructured":"Cheney, J., Hinze, R.: First-class phantom types. Technical Report. CUCIS TR2003-1901, Cornell University (2003)"},{"key":"2_CR4","unstructured":"Christensen, D.: Practical Reflection and Metaprogramming for Dependent Types. Ph.D. thesis, IT University of Copenhagen (2015)"},{"key":"2_CR5","unstructured":"Coq Development Team: The Coq proof assistant, version 8.19.2 (2024)"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Coquand, T., Paulin-Mohring, C.: Inductively defined types. In: COLOG-88, pp. 50\u201366 (1990). https:\/\/doi.org\/10.1007\/3-540-52335-9_47","DOI":"10.1007\/3-540-52335-9_47"},{"issue":"4","key":"2_CR7","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/BF01211308","volume":"6","author":"P Dybjer","year":"1994","unstructured":"Dybjer, P.: Inductive families. Formal Aspects Comput. 6(4), 440\u2013465 (1994). https:\/\/doi.org\/10.1007\/BF01211308","journal-title":"Formal Aspects Comput."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Hinze, R.: Fun with phantom types. In: The Fun of Programming, pp. 245\u2013262. Palgrave Macmillan (2003)","DOI":"10.1007\/978-1-349-91518-7_12"},{"key":"2_CR9","unstructured":"Idris: A language for type-driven development. https:\/\/www.idris-lang.org\/"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Johann, P., Ghiorzi, E.: (Deep) induction rules for GADTs. In: Certified Programs and Proofs, pp. 324\u2013337 (2022). https:\/\/doi.org\/10.1145\/3497775.3503680","DOI":"10.1145\/3497775.3503680"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Johann, P., Polonsky, A.: Deep induction: induction rules for (truly) nested types. In: Foundations of Software Science and Computation Structures, pp. 339\u2013358 (2020). https:\/\/doi.org\/10.1007\/978-3-030-45231-5_18","DOI":"10.1007\/978-3-030-45231-5_18"},{"key":"2_CR12","unstructured":"McBride, C.: Dependently Typed Programs and their Proofs. Ph.D. thesis, University of Edinburgh (1999)"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"McBride, C.: Epigram: practical programming with dependent types. In: Advanced Functional Programming, pp. 130\u2013170 (2005). https:\/\/doi.org\/10.1007\/11546382_3","DOI":"10.1007\/11546382_3"},{"issue":"1","key":"2_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1017\/S0956796803004829","volume":"14","author":"C McBride","year":"2004","unstructured":"McBride, C., McKinna, J.: The view from the left. J. Funct. Program. 14(1), 69\u2013111 (2004). https:\/\/doi.org\/10.1017\/S0956796803004829","journal-title":"J. Funct. Program."},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Milner, R., Tofte, M., Harper, R., MacQueen, D.: The Definition of Standard ML, Revised edn. MIT Press, Cambridge (1997). https:\/\/doi.org\/10.7551\/mitpress\/2319.001.0001","DOI":"10.7551\/mitpress\/2319.001.0001"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Norell, U.: Dependently typed programming in Agda. Lecture Notes, Advanced Functional Programming Summer School (2008)","DOI":"10.1007\/978-3-642-04652-0_5"},{"key":"2_CR17","unstructured":"Peyton\u00a0Jones, S.L. (ed.): Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press, Cambridge (2003)"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Schrijvers, T., Peyton\u00a0Jones, S.L., Sulzmann, M., Vytiniotis, D.: Complete and decidable type inference for GADTs. In: International Conference on Functional Programming, pp. 341\u2013352 (2009). https:\/\/doi.org\/10.1145\/1596550.1596599","DOI":"10.1145\/1596550.1596599"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Sheard, T., Pasalic, E.: Meta-programming with built-in type equality. In: Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-languages, pp. 49\u201365 (2008). https:\/\/doi.org\/10.1016\/j.entcs.2007.11.012","DOI":"10.1016\/j.entcs.2007.11.012"},{"key":"2_CR20","doi-asserted-by":"publisher","unstructured":"Tassi, E.: Deriving proved equality tests in Coq-elpi: stronger induction principles for containers in Coq. In: 10th International Conference on Interactive Theorem Proving, pp. 1\u201318 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ITP.2019.29","DOI":"10.4230\/LIPIcs.ITP.2019.29"},{"key":"2_CR21","unstructured":"Ullrich, M.: Generating induction principles for nested induction types in MetaCoq. Bachelor thesis, Saarland University (2020)"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Xi, H., Chen, C., Chen, G.: Guarded recursive datatype constructors. In: Principles of Programming Languages, pp. 224\u2013235 (2003). https:\/\/doi.org\/10.1145\/604131.604150","DOI":"10.1145\/604131.604150"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-99536-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T14:07:04Z","timestamp":1765116424000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-99536-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,1]]},"ISBN":["9783031995354","9783031995361"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-99536-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,1]]},"assertion":[{"value":"1 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WoLLIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Logic, Language, Information, and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wollic2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wollic.org\/wollic2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}