{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:09Z","timestamp":1772164029535,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,1,17]],"date-time":"2010-01-17T00:00:00Z","timestamp":1263686400000},"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":[[2010,1,17]]},"DOI":"10.1145\/1706299.1706333","type":"proceedings-article","created":{"date-parts":[[2010,1,19]],"date-time":"2010-01-19T15:15:04Z","timestamp":1263914104000},"page":"275-286","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Dependent types and program equivalence"],"prefix":"10.1145","author":[{"given":"Limin","family":"Jia","sequence":"first","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]},{"given":"Jianzhou","family":"Zhao","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]},{"given":"Vilhelm","family":"Sj\u00f6berg","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]},{"given":"Stephanie","family":"Weirich","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2010,1,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Draft","author":"Altenkirch Thorsten","year":"2008","unstructured":"Thorsten Altenkirch and Nicolas Oury . PiSigma : A core language for dependently typed programming . Draft , 2008 . Thorsten Altenkirch and Nicolas Oury. PiSigma: A core language for dependently typed programming. Draft, 2008."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/289423.289451"},{"key":"e_1_3_2_1_3_1","volume-title":"October","author":"Aydemir Brian","year":"2009","unstructured":"Brian Aydemir and Stephanie Weirich . LNgen: Tool support for locally nameless representations. Submitted for publication , October 2009 . Brian Aydemir and Stephanie Weirich. LNgen: Tool support for locally nameless representations. Submitted for publication, October 2009."},{"key":"e_1_3_2_1_4_1","volume-title":"The lambda calculus: Its syntax and semantics. North-Holland Pub","author":"Barendregt H. P.","year":"1981","unstructured":"H. P. Barendregt . The lambda calculus: Its syntax and semantics. North-Holland Pub . Co ., 1981 . H. P. Barendregt. The lambda calculus: Its syntax and semantics. North-Holland Pub. Co., 1981."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792803.1792829"},{"key":"e_1_3_2_1_7_1","volume-title":"The Coq Proof Assistant Reference Manual (Version 8.2)","author":"Development Team The Coq","year":"2009","unstructured":"The Coq Development Team . The Coq Proof Assistant Reference Manual (Version 8.2) , 2009 . URL http:\/\/coq.inria.fr. The Coq Development Team. The Coq Proof Assistant Reference Manual (Version 8.2), 2009. URL http:\/\/coq.inria.fr."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/120477.120486"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1244381.1244400"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800001210"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111042"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800000125"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796803004829"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792803.1792828"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411237"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/1-4020-8141-3_34"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411213"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159803.1159811"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792878.1792887"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111058"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291155"},{"key":"e_1_3_2_1_25_1","first-page":"105","volume-title":"The 1st workshop on Programming Languages meets Program Verification (PLPV)","author":"Sheard T.","year":"2006","unstructured":"T. Sheard . Type-level computation using narrowing in \u00a9omega . In The 1st workshop on Programming Languages meets Program Verification (PLPV) , pages 105 -- 128 , 2006 . T. Sheard. Type-level computation using narrowing in \u00a9omega. In The 1st workshop on Programming Languages meets Program Verification (PLPV), pages 105--128, 2006."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/325694.325724"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1481848.1481856"},{"key":"e_1_3_2_1_28_1","volume-title":"8th Symp. on Trends in Functional Programming","author":"Vytiniotis Dimitrios","year":"2007","unstructured":"Dimitrios Vytiniotis and Stephanie Weirich . Dependent types : Easy as PIE . In 8th Symp. on Trends in Functional Programming , 2007 . Dimitrios Vytiniotis and Stephanie Weirich. Dependent types: Easy as PIE. In 8th Symp. on Trends in Functional Programming, 2007."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(98)00047-5"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1093"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24849-1_25"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292560"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/604131.604150"}],"event":{"name":"POPL '10: The 37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Madrid Spain","acronym":"POPL '10","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1706299.1706333","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1706299.1706333","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:26:19Z","timestamp":1750263979000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1706299.1706333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,17]]},"references-count":29,"alternative-id":["10.1145\/1706299.1706333","10.1145\/1706299"],"URL":"https:\/\/doi.org\/10.1145\/1706299.1706333","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1707801.1706333","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,1,17]]},"assertion":[{"value":"2010-01-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}