{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:11Z","timestamp":1772164031575,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,1,8]],"date-time":"2014-01-08T00:00:00Z","timestamp":1389139200000},"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":[[2014,1,8]]},"DOI":"10.1145\/2535838.2535856","type":"proceedings-article","created":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T08:40:06Z","timestamp":1389688806000},"page":"671-683","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":55,"title":["Closed type families with overlapping equations"],"prefix":"10.1145","author":[{"given":"Richard A.","family":"Eisenberg","sequence":"first","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]},{"given":"Dimitrios","family":"Vytiniotis","sequence":"additional","affiliation":[{"name":"Microsoft Research Cambridge, Cambridge, United Kingdom"}]},{"given":"Simon","family":"Peyton Jones","sequence":"additional","affiliation":[{"name":"Microsoft Research Cambridge, Cambridge, United Kingdom"}]},{"given":"Stephanie","family":"Weirich","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,1,8]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086365.1086397"},{"key":"e_1_3_2_2_2_1","volume-title":"LogiCal Project","author":"Coq","year":"2004","unstructured":"Coq development team. The Coq proof assistant reference manual . LogiCal Project , 2004 . URL http:\/\/coq.inria.fr. Version 8.0. Coq development team. The Coq proof assistant reference manual. LogiCal Project, 2004. URL http:\/\/coq.inria.fr. Version 8.0."},{"key":"e_1_3_2_2_3_1","volume-title":"Fundamental properties of infinite trees. Theoretical computer science, 25 (2): 95--169","author":"Courcelle B.","year":"1983","unstructured":"B. Courcelle . Fundamental properties of infinite trees. Theoretical computer science, 25 (2): 95--169 , 1983 . B. Courcelle. Fundamental properties of infinite trees. Theoretical computer science, 25 (2): 95--169, 1983."},{"key":"e_1_3_2_2_4_1","volume-title":"Closed type families with overlapping equations (extended version). Technical report","author":"Eisenberg R. A.","year":"2013","unstructured":"R. A. Eisenberg , D. Vytiniotis , S. Peyton Jones , and S. Weirich . Closed type families with overlapping equations (extended version). Technical report , University of Pennsylvania , 2013 . R. A. Eisenberg, D. Vytiniotis, S. Peyton Jones, and S. Weirich. Closed type families with overlapping equations (extended version). Technical report, University of Pennsylvania, 2013."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800003658"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/949305.949317"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322230"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037057"},{"key":"e_1_3_2_2_10_1","unstructured":"M. P.\n      Jones\n    .\n  Type classes with functional dependencies\n  . In G. Smolka editor ESOP volume \n  1782\n   of \n  Lecture Notes in Computer Science pages \n  230\n  --\n  244\n  . \n  Springer 2000\n  . ISBN 3--540--67262--1.   M. P. Jones. Type classes with functional dependencies. In G. Smolka editor ESOP volume 1782 of Lecture Notes in Computer Science pages 230--244. Springer 2000. ISBN 3--540--67262--1."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1017472.1017488"},{"key":"e_1_3_2_2_12_1","first-page":"1","volume-title":"Handbook of logic in computer science (vol. 2)","author":"Klop J.","year":"1993","unstructured":"J. Klop . Term rewriting systems . In Handbook of logic in computer science (vol. 2) , pages 1 -- 116 . Oxford University Press, Inc. , 1993 . J. Klop. Term rewriting systems. In Handbook of logic in computer science (vol. 2), pages 1--116. Oxford University Press, Inc., 1993."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/62029.62030"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796802004355"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863596"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.2307\/1968867"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411215"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190315.1190324"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796806006137"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796808006758"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1707790.1707799"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926411"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500599"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103786.2103795"}],"event":{"name":"POPL '14: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"San Diego California USA","acronym":"POPL '14","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2535838.2535856","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2535838.2535856","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:06Z","timestamp":1750219806000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2535838.2535856"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,8]]},"references-count":23,"alternative-id":["10.1145\/2535838.2535856","10.1145\/2535838"],"URL":"https:\/\/doi.org\/10.1145\/2535838.2535856","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2578855.2535856","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2014,1,8]]},"assertion":[{"value":"2014-01-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}