{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:50Z","timestamp":1763468150326,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,24]],"date-time":"2013-09-24T00:00:00Z","timestamp":1379980800000},"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,9,24]]},"DOI":"10.1145\/2502409.2502414","type":"proceedings-article","created":{"date-parts":[[2013,9,17]],"date-time":"2013-09-17T19:57:05Z","timestamp":1379447825000},"page":"49-60","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Leveling up dependent types"],"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":[[2013,9,24]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1782894.1782898"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1292597.1292608"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/985799.985801"},{"key":"e_1_3_2_2_4_1","first-page":"115","volume-title":"TYPES","author":"Brady E.","year":"2003","unstructured":"E. Brady , C. McBride , and J. McKinna . Inductive Families Need Not Store Their Indices . In TYPES , pages 115 -- 129 , 2003 . E. Brady, C. McBride, and J. McKinna. Inductive Families Need Not Store Their Indices. In TYPES, pages 115--129, 2003."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1932681.1863547"},{"key":"e_1_3_2_2_6_1","volume-title":"Summary of question posed on twitter, oct","author":"Diehl L.","year":"2012","unstructured":"L. Diehl . Summary of question posed on twitter, oct 2012 . URL https:\/\/gist.github.com\/larrytheliquid\/3909860. L. Diehl. Summary of question posed on twitter, oct 2012. URL https:\/\/gist.github.com\/larrytheliquid\/3909860."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/645894.671773"},{"issue":"1","key":"e_1_3_2_2_8_1","first-page":"1","volume":"124","author":"Dybjer P.","year":"2003","unstructured":"P. Dybjer and A. Setzer . Induction-recursion and initial algebras. Annals of Pure and Applied Logic , 124 ( 1 ): 1 -- 47 , 2003 . P. Dybjer and A. Setzer. Induction-recursion and initial algebras. Annals of Pure and Applied Logic, 124 (1): 1--47, 2003.","journal-title":"Induction-recursion and initial algebras. Annals of Pure and Applied Logic"},{"key":"e_1_3_2_2_10_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/11780274_27","volume-title":"Eliminating dependent pattern matching","author":"Goguen H.","year":"2006","unstructured":"H. Goguen , C. McBride , and J. McKinna . Eliminating dependent pattern matching . In Lecture Notes in Computer Science , pages 521 -- 540 . Springer , 2006 . H. Goguen, C. McBride, and J. McKinna. Eliminating dependent pattern matching. In Lecture Notes in Computer Science, pages 521--540. Springer, 2006."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/BFb0014058","volume-title":"phTyped Lambda Calculi and Applications","author":"Hurkens A.","year":"1995","unstructured":"A. Hurkens . A simplification of girard's paradox. phTyped Lambda Calculi and Applications , pages 266 -- 278 , 1995 . A. Hurkens. A simplification of girard's paradox. phTyped Lambda Calculi and Applications, pages 266--278, 1995."},{"key":"e_1_3_2_2_12_1","volume-title":"Intuitionistic type theory. Notes by Giovanni Sambin","author":"Martin-L\u00f6f P.","year":"1984","unstructured":"P. Martin-L\u00f6f . Intuitionistic type theory. Notes by Giovanni Sambin , 1984 . P. Martin-L\u00f6f. Intuitionistic type theory. Notes by Giovanni Sambin, 1984."},{"key":"e_1_3_2_2_13_1","volume-title":"Dependently typed functional programs and their proofs","author":"McBride C.","year":"2000","unstructured":"C. McBride . Dependently typed functional programs and their proofs . 2000 . C. McBride. Dependently typed functional programs and their proofs. 2000."},{"key":"e_1_3_2_2_14_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_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11546382_3"},{"key":"e_1_3_2_2_16_1","volume-title":"Nov.","author":"McBride C.","year":"2011","unstructured":"C. McBride . Hier soir, an ott hierarchy , Nov. 2011 . URL http:\/\/www.e-pig.org\/epilogue\/?p=1098. C. McBride. Hier soir, an ott hierarchy, Nov. 2011. URL http:\/\/www.e-pig.org\/epilogue\/?p=1098."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796803004829"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11617990_16"},{"key":"e_1_3_2_2_19_1","volume-title":"Programming in Martin-L\u00f6f's type theory","author":"Nordstr\u00f6m B.","year":"1990","unstructured":"B. Nordstr\u00f6m , K. Petersson , and J. M. Smith . Programming in Martin-L\u00f6f's type theory , volume 85 . Oxford University Press , 1990 . B. Nordstr\u00f6m, K. Petersson, and J. M. Smith. Programming in Martin-L\u00f6f's type theory, volume 85. Oxford University Press, 1990."},{"key":"e_1_3_2_2_20_1","volume-title":"phTowards a practical programming language based on dependent type theory","author":"Norell U.","year":"2007","unstructured":"U. Norell . phTowards a practical programming language based on dependent type theory . Chalmers University of Technology , 2007 . U. Norell. phTowards a practical programming language based on dependent type theory. Chalmers University of Technology, 2007."},{"key":"e_1_3_2_2_21_1","volume-title":"On universes in type theory. In 191--204","author":"Palmgren E.","year":"1998","unstructured":"E. Palmgren . On universes in type theory. In 191--204 . Oxford University Press , 1998 . E. Palmgren. On universes in type theory. In 191--204. Oxford University Press, 1998."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1707790.1707799"}],"event":{"name":"ICFP'13: ACM SIGPLAN International Conference on Functional Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Boston Massachusetts USA","acronym":"ICFP'13"},"container-title":["Proceedings of the 2013 ACM SIGPLAN workshop on Dependently-typed programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2502409.2502414","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2502409.2502414","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:35Z","timestamp":1750231715000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2502409.2502414"}},"subtitle":["generic programming over a predicative hierarchy of universes"],"short-title":[],"issued":{"date-parts":[[2013,9,24]]},"references-count":21,"alternative-id":["10.1145\/2502409.2502414","10.1145\/2502409"],"URL":"https:\/\/doi.org\/10.1145\/2502409.2502414","relation":{},"subject":[],"published":{"date-parts":[[2013,9,24]]},"assertion":[{"value":"2013-09-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}