{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T21:58:48Z","timestamp":1784239128309,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,1,23]],"date-time":"2013-01-23T00:00:00Z","timestamp":1358899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,1,23]]},"DOI":"10.1145\/2429069.2429094","type":"proceedings-article","created":{"date-parts":[[2013,1,22]],"date-time":"2013-01-22T10:29:29Z","timestamp":1358850569000},"page":"207-218","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["Meta-theory \u00e0 la carte"],"prefix":"10.1145","author":[{"given":"Benjamin","family":"Delaware","sequence":"first","affiliation":[{"name":"University of Texas at Austin, Austin, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bruno C.","family":"d. S. Oliveira","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tom","family":"Schrijvers","sequence":"additional","affiliation":[{"name":"Universiteit Gent, Ghent, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,1,23]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328443"},{"key":"e_1_3_2_2_2_1","volume-title":"LNgen: Tool Support for Locally Nameless Representations","author":"Aydemir B. E.","year":"2009","unstructured":"B. E. Aydemir and S. Weirich . LNgen: Tool Support for Locally Nameless Representations , 2009 . Unpublished manuscript. B. E. Aydemir and S. Weirich. LNgen: Tool Support for Locally Nameless Representations, 2009. Unpublished manuscript."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11541868_4"},{"key":"e_1_3_2_2_4_1","first-page":"38","volume-title":"Proceedings of the 23rd Nordic Workshop on Programming Theory, NWPT '11","author":"Bahr P.","year":"2011","unstructured":"P. Bahr . Evaluation ` a la carte: Non-strict evaluation via compositional data types . In Proceedings of the 23rd Nordic Workshop on Programming Theory, NWPT '11 , pages 38 -- 40 , 2011 . P. Bahr. Evaluation `a la carte: Non-strict evaluation via compositional data types. In Proceedings of the 23rd Nordic Workshop on Programming Theory, NWPT '11, pages 38--40, 2011."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2047862.2047867"},{"key":"e_1_3_2_2_6_1","first-page":"39","article-title":"Automatic synthesis of typed lambdaprograms on term algebras","author":"B\u00f6hm C.","year":"1985","unstructured":"C. B\u00f6hm and A. Berarducci . Automatic synthesis of typed lambdaprograms on term algebras . Theor. Comput. Sci. , 39 , 1985 . C. B\u00f6hm and A. Berarducci. Automatic synthesis of typed lambdaprograms on term algebras. Theor. Comput. Sci., 39, 1985.","journal-title":"Theor. Comput. Sci."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30142-4_4"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411226"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/319838.319847"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2398856.2364546"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2048066.2048113"},{"key":"e_1_3_2_2_14_1","volume-title":"Using catamorphisms, subtypes and monad transformers for writing modular functional interpreters","author":"Duponcheel L.","year":"1995","unstructured":"L. Duponcheel . Using catamorphisms, subtypes and monad transformers for writing modular functional interpreters ., 1995 . L. Duponcheel. Using catamorphisms, subtypes and monad transformers for writing modular functional interpreters., 1995."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034574.2034777"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321997"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034574.2034798"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796804005313"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796899003500"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.02.017"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28869-2_22"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538788.1538814"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796802004550"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/645391.651446"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199528"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/800055.802036"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"e_1_3_2_2_29_1","volume-title":"WMM '06","author":"Mulhern A.","year":"2006","unstructured":"A. Mulhern . Proof weaving . In WMM '06 , September 2006 . A. Mulhern. Proof weaving. In WMM '06, September 2006."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03013-0_13"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31057-7_2"},{"key":"e_1_3_2_2_32_1","volume-title":"Trends in Functional Programming","author":"Oliveira B. C. d. S.","year":"2006","unstructured":"B. C. d. S. Oliveira , R. Hinze , and A. L\u00f6h . Extensible and modular generics for the masses . In Trends in Functional Programming , 2006 . B. C. d. S. Oliveira, R. Hinze, and A. L\u00f6h. Extensible and modular generics for the masses. In Trends in Functional Programming, 2006."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739230.1739244"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/645891.671440"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/101514.101522"},{"key":"e_1_3_2_2_36_1","volume-title":"CADE'99","author":"Pfenning F.","year":"1999","unstructured":"F. Pfenning and C. Sch\u00fcrmann . System description: Twelf - a metalogical framework for deductive systems . In CADE'99 , 1999 . F. Pfenning and C. Sch\u00fcrmann. System description: Twelf - a metalogical framework for deductive systems. In CADE'99, 1999."},{"key":"e_1_3_2_2_37_1","volume-title":"Types and Programming Languages","author":"Pierce B. C.","year":"2002","unstructured":"B. C. Pierce . Types and Programming Languages . MIT Press , 2002 . B. C. Pierce. Types and Programming Languages. MIT Press, 2002."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00138-X"},{"key":"e_1_3_2_2_39_1","volume-title":"Twenty Five Years of Constructive Type Theory","author":"Pollack Robert","year":"1998","unstructured":"Robert Pollack . How to believe a machine-checked proof . In Twenty Five Years of Constructive Type Theory , 1998 . Robert Pollack. How to believe a machine-checked proof. In Twenty Five Years of Constructive Type Theory, 1998."},{"key":"e_1_3_2_2_40_1","volume-title":"Modular type-safety proofs using dependant types. CoRR, abs\/1208.0535","author":"Schwaab Christopher","year":"2012","unstructured":"Christopher Schwaab and Jeremy G. Siek . Modular type-safety proofs using dependant types. CoRR, abs\/1208.0535 , 2012 . Christopher Schwaab and Jeremy G. Siek. Modular type-safety proofs using dependant types. CoRR, abs\/1208.0535, 2012."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291155"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71067-7_23"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796808006758"},{"key":"e_1_3_2_2_44_1","first-page":"69","volume-title":"WGP'00","author":"Uustalu T.","year":"2000","unstructured":"T. Uustalu and V. Vene . Coding recursion a la Mendler . In WGP'00 , pages 69 -- 85 , 2000 . T. Uustalu and V. Vene. Coding recursion a la Mendler. In WGP'00, pages 69--85, 2000."},{"key":"e_1_3_2_2_45_1","volume-title":"Email","author":"Wadler P.","year":"1998","unstructured":"P. Wadler . The Expression Problem . Email , November 1998 . Discussion on the Java Genericity mailing list. P. Wadler. The Expression Problem. Email, November 1998. Discussion on the Java Genericity mailing list."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75283"}],"event":{"name":"POPL '13: The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Rome Italy","acronym":"POPL '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429069.2429094","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2429069.2429094","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:35Z","timestamp":1750221335000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429069.2429094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,23]]},"references-count":43,"alternative-id":["10.1145\/2429069.2429094","10.1145\/2429069"],"URL":"https:\/\/doi.org\/10.1145\/2429069.2429094","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2480359.2429094","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,1,23]]},"assertion":[{"value":"2013-01-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}