{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T04:02:55Z","timestamp":1751774575721,"version":"3.41.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319948201"},{"type":"electronic","value":"9783319948218"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-94821-8_14","type":"book-chapter","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T17:25:55Z","timestamp":1530638755000},"page":"235-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Mendler-Style Lambda-Encodings in Cedille"],"prefix":"10.1007","author":[{"given":"Denis","family":"Firsov","sequence":"first","affiliation":[]},{"given":"Richard","family":"Blair","sequence":"additional","affiliation":[]},{"given":"Aaron","family":"Stump","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"key":"14_CR1","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":"14_CR2","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":"14_CR3","doi-asserted-by":"crossref","unstructured":"Firsov, D., Stump, A.: Generic derivation of induction for impredicative encodings in cedille. In: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2018, New York, NY, USA, pp. 215\u2013227. ACM (2018)","DOI":"10.1145\/3167087"},{"key":"14_CR4","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 1989","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":"14_CR5","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 1988","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":"14_CR6","doi-asserted-by":"publisher","first-page":"e3","DOI":"10.1017\/S0956796816000034","volume":"26","author":"A Stump","year":"2016","unstructured":"Stump, A., Fu, P.: Efficiency of lambda-encodings in total type theory. J. Funct. Program. 26, e3 (2016)","journal-title":"J. Funct. Program."},{"key":"14_CR7","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, 637\u2013655 (2018)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1\u20133","key":"14_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0168-0072(98)00047-5","volume":"98","author":"JB Wells","year":"1999","unstructured":"Wells, J.B.: Typability and type checking in system F are equivalent and undecidable. Ann. Pure Appl. Logic 98(1\u20133), 111\u2013156 (1999)","journal-title":"Ann. Pure Appl. Logic"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Kopylov, A.: Dependent intersection: a new way of defining records in type theory. In: 18th IEEE Symposium on Logic in Computer Science (LICS), pp. 86\u201395 (2003)","DOI":"10.1109\/LICS.2003.1210048"},{"key":"14_CR10","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":"14_CR11","doi-asserted-by":"crossref","unstructured":"Diehl, L., Firsov, D., Stump, A.: Generic zero-cost reuse for dependent types. CoRR abs\/1803.08150 (2018)","DOI":"10.1145\/3236799"},{"issue":"3","key":"14_CR12","first-page":"343","volume":"6","author":"T Uustalu","year":"1999","unstructured":"Uustalu, T., Vene, V.: Mendler-style inductive types, categorically. Nordic J. Comput. 6(3), 343\u2013361 (1999)","journal-title":"Nordic J. Comput."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Recursive types for free! (1990)","DOI":"10.1145\/99370.99404"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-52335-9_47","volume-title":"COLOG 1988","author":"T Coquand","year":"1990","unstructured":"Coquand, T., Paulin, C.: Inductively defined types. In: Martin-L\u00f6f, P., Mints, G. (eds.) COLOG 1988. LNCS, vol. 417, pp. 50\u201366. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-52335-9_47"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BFb0040259","volume-title":"Mathematical Foundations of Programming Semantics","author":"F Pfenning","year":"1990","unstructured":"Pfenning, F., Paulin-Mohring, C.: Inductively defined types in the Calculus of Constructions. In: Main, M., Melton, A., Mislove, M., Schmidt, D. (eds.) MFPS 1989. LNCS, vol. 442, pp. 209\u2013228. Springer, New York (1990)"},{"issue":"4","key":"14_CR16","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1017\/S0956796808006758","volume":"18","author":"W Swierstra","year":"2008","unstructured":"Swierstra, W.: Data types \u00e0 la carte. J. Funct. Program. 18(4), 423\u2013436 (2008)","journal-title":"J. Funct. Program."},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Delaware, B., d. S. Oliveira, B.C., Schrijvers, T.: Meta-theory \u00e0 la carte. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2013, New York, NY, USA, pp. 207\u2013218. ACM (2013)","DOI":"10.1145\/2480359.2429094"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-43144-4_25","volume-title":"Interactive Theorem Proving","author":"P Torrini","year":"2016","unstructured":"Torrini, P.: Modular dependent induction in Coq, Mendler-style. In: Blanchette, J.C., Merz, S. (eds.) ITP 2016. LNCS, vol. 9807, pp. 409\u2013424. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-43144-4_25"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Traytel, D., Popescu, A., Blanchette, J.C.: Foundational, compositional (Co)datatypes for higher-order logic: category theory applied to theorem proving. In: Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, 25\u201328 June 2012, pp. 596\u2013605. IEEE Computer Society (2012)","DOI":"10.1109\/LICS.2012.75"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-66167-4_1","volume-title":"Frontiers of Combining Systems","author":"J Biendarra","year":"2017","unstructured":"Biendarra, J., et al.: Foundational (Co)datatypes and (Co)recursion for higher-order logic. In: Dixon, C., Finger, M. (eds.) FroCoS 2017. LNCS (LNAI), vol. 10483, pp. 3\u201321. Springer, Cham (2017)"}],"container-title":["Lecture Notes in Computer Science","Interactive Theorem Proving"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94821-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T14:56:32Z","timestamp":1751727392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94821-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319948201","9783319948218"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94821-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ITP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Interactive Theorem Proving","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"itp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/itp2018.inria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}