{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:17:10Z","timestamp":1763468230325,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,8,26]],"date-time":"2014-08-26T00:00:00Z","timestamp":1409011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1320934"],"award-info":[{"award-number":["1320934"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,8,26]]},"DOI":"10.1145\/2633628.2633630","type":"proceedings-article","created":{"date-parts":[[2014,8,29]],"date-time":"2014-08-29T13:03:43Z","timestamp":1409317423000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Generic constructors and eliminators from descriptions"],"prefix":"10.1145","author":[{"given":"Larry","family":"Diehl","sequence":"first","affiliation":[{"name":"Portland State University, Portland, OR, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Sheard","sequence":"additional","affiliation":[{"name":"Portland State University, Portland, OR, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,8,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Dec.","author":"Atkey R.","year":"2011","unstructured":"R. Atkey . A type checker that knows its monad from its elbow. blog post , Dec. 2011 . URL http:\/\/bentnib.org\/posts\/2011-12-14-type-checker.html. R. Atkey. A type checker that knows its monad from its elbow. blog post, Dec. 2011. URL http:\/\/bentnib.org\/posts\/2011-12-14-type-checker.html."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1929529.1929536"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863547"},{"key":"e_1_3_2_1_4_1","volume-title":"Certified programming with dependent types","author":"Chlipala A.","year":"2011","unstructured":"A. Chlipala . Certified programming with dependent types , 2011 . A. Chlipala. Certified programming with dependent types, 2011."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2364527.2364544"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/3-540-60579-7_3","volume-title":"Types for proofs and Programs","author":"Gim\u00e9nez E.","year":"1995","unstructured":"E. Gim\u00e9nez . Codifying guarded definitions with recursive schemes . In Types for proofs and Programs , pages 39 -- 59 . Springer , 1995 . E. Gim\u00e9nez. Codifying guarded definitions with recursive schemes. In Types for proofs and Programs, pages 39--59. Springer, 1995."},{"key":"e_1_3_2_1_8_1","volume-title":"Haskell 98 language and libraries: the revised report","author":"Jones S. L. P.","year":"2003","unstructured":"S. L. P. Jones . Haskell 98 language and libraries: the revised report . Cambridge University Press , 2003 . S. L. P. Jones. Haskell 98 language and libraries: the revised report. Cambridge University Press, 2003."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/365230.365257"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)71945-1"},{"key":"e_1_3_2_1_11_1","first-page":"197","volume-title":"TYPES '00","author":"McBride C.","year":"2002","unstructured":"C. McBride . Elimination with a motive. In Selected papers from the International Workshop on Types for Proofs and Programs , TYPES '00 , pages 197 -- 216 , London, UK, UK , 2002 . Springer-Verlag. ISBN 3-540-43287-6. URL http:\/\/dl.acm.org\/citation.cfm?id=646540.759262. C. McBride. Elimination with a motive. In Selected papers from the International Workshop on Types for Proofs and Programs, TYPES '00, pages 197--216, London, UK, UK, 2002. Springer-Verlag. ISBN 3-540-43287-6. URL http:\/\/dl.acm.org\/citation.cfm?id=646540.759262."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11546382_3"},{"key":"e_1_3_2_1_13_1","volume-title":"Ornamental algebras, algebraic ornaments","author":"McBride C.","year":"2011","unstructured":"C. McBride . Ornamental algebras, algebraic ornaments . 2011 . C. McBride. Ornamental algebras, algebraic ornaments. 2011."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11617990_12"},{"key":"e_1_3_2_1_15_1","volume-title":"Towards a practical programming language based on dependent type theory","author":"Norell U.","year":"2007","unstructured":"U. Norell . Towards a practical programming language based on dependent type theory . Chalmers University of Technology , 2007 . U. Norell. Towards a practical programming language based on dependent type theory. Chalmers University of Technology, 2007."},{"key":"e_1_3_2_1_16_1","volume-title":"The Coq Proof Assistant Reference Manual","author":"Development Team The Coq","year":"2008","unstructured":"The Coq Development Team . The Coq Proof Assistant Reference Manual , 2008 . URL http:\/\/coq.inria.fr. The Coq Development Team. The Coq Proof Assistant Reference Manual, 2008. URL http:\/\/coq.inria.fr."}],"event":{"name":"ICFP'14: ACM SIGPLAN International Conference on Functional Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Gothenburg Sweden","acronym":"ICFP'14"},"container-title":["Proceedings of the 10th ACM SIGPLAN workshop on Generic programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2633628.2633630","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2633628.2633630","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:56:11Z","timestamp":1750229771000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2633628.2633630"}},"subtitle":["type theory as a dependently typed internal DSL"],"short-title":[],"issued":{"date-parts":[[2014,8,26]]},"references-count":15,"alternative-id":["10.1145\/2633628.2633630","10.1145\/2633628"],"URL":"https:\/\/doi.org\/10.1145\/2633628.2633630","relation":{},"subject":[],"published":{"date-parts":[[2014,8,26]]},"assertion":[{"value":"2014-08-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}