{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T08:32:21Z","timestamp":1770280341061,"version":"3.49.0"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"ICFP","license":[{"start":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T00:00:00Z","timestamp":1693353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2006535"],"award-info":[{"award-number":["2006535"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2023,8,30]]},"abstract":"<jats:p>In dependently-typed functional programming languages that allow general  \n recursion, programs used as proofs must be evaluated to retain type soundness. As a result,  \n programmers must make a trade-off between performance and safety. To address  \n this problem, we propose System DE, an explicitly-typed, moded core calculus  \n that supports termination tracking and equality reflection. Programmers can  \n write inductive proofs about potentially diverging programs in a logical  \n sublanguage and reflect those proofs to the type checker, while knowing that  \n such proofs will be erased by the compiler before execution. A key  \n feature of System DE is its use of modes for both termination and relevance  \n tracking, which not only simplifies the design but also leaves it  \n open for future extension. System DE is suitable for use in the Glasgow  \n Haskell Compiler, but could serve as the basis for any general purpose  \n dependently-typed language.<\/jats:p>","DOI":"10.1145\/3607852","type":"journal-article","created":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T17:40:31Z","timestamp":1693503631000},"page":"649-685","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Dependently-Typed Programming with Logical Equality Reflection"],"prefix":"10.1145","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-8717-2498","authenticated-orcid":false,"given":"Yiyun","family":"Liu","sequence":"first","affiliation":[{"name":"University of Pennsylvania, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6756-9168","authenticated-orcid":false,"given":"Stephanie","family":"Weirich","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,8,31]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3408972"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-8(1:29)2012"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796805005770"},{"key":"e_1_2_1_4_1","unstructured":"Agda Development Team. 2023. Agda. https:\/\/wiki.portal.chalmers.se\/agda\/Main\/HomePage"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209108.3209189"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78499-9_26"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129505004822"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ECOOP.2021.9"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796816000150"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-1(2:1)2005"},{"key":"e_1_2_1_11_1","volume-title":"A Polymorphic Lambda Calculus with Type:Type","author":"Cardelli Luca","unstructured":"Luca Cardelli. 1986. A Polymorphic Lambda Calculus with Type:Type. Digital Equipment Corporation, SRC. https:\/\/www.hpl.hp.com\/techreports\/Compaq-DEC\/SRC-RR-10.pdf"},{"key":"e_1_2_1_12_1","volume-title":"Combining Proofs and Programs. Ph. D. Dissertation","author":"Casinghino Chris","unstructured":"Chris Casinghino. 2014. Combining Proofs and Programs. Ph. D. Dissertation. University of Pennsylvania. https:\/\/repository.upenn.edu\/handle\/20.500.14332\/28018"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535883"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-99336-8_15"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341704"},{"key":"e_1_2_1_16_1","unstructured":"R. L. Constable S. F. Allen H. M. Bromley W. R. Cleaveland J. F. Cremer R. W. Harper D. J. Howe T. B. Knoblock N. P. Mendler P. Panangaden J. T. Sasaki and S. F. Smith. 1986. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall Inc. USA. isbn:0134518322"},{"key":"e_1_2_1_17_1","volume-title":"Partial objects in constructive type theory","author":"Constable Robert L","unstructured":"Robert L Constable and Scott Fraser Smith. 1987. Partial objects in constructive type theory. Cornell University. Department of Computer Science."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","unstructured":"Coq Development Team. 2019. The Coq Proof Assistant. https:\/\/doi.org\/10.5281\/zenodo.3476303 10.5281\/zenodo.3476303","DOI":"10.5281\/zenodo.3476303"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52335-9_47"},{"key":"e_1_2_1_20_1","volume-title":"Dependent Types in Haskell: Theory and Practice. Ph. D. Dissertation","author":"Eisenberg Richard Alan","unstructured":"Richard Alan Eisenberg. 2016. Dependent Types in Haskell: Theory and Practice. Ph. D. Dissertation. University of Pennsylvania. https:\/\/repository.upenn.edu\/handle\/20.500.14332\/29166"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062357"},{"key":"e_1_2_1_22_1","unstructured":"GHC Development Team. 2023. The Glasgow Haskell Compiler. https:\/\/www.haskell.org\/ghc\/"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.48730\/jt3g-ws74"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1017472.1017488"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","unstructured":"Yiyun Liu and Stephanie Weirich. 2023. Artifact associated with Dependently-Typed Programming with Logical Equality Reflection. https:\/\/doi.org\/10.1145\/3580401 10.1145\/3580401","DOI":"10.1145\/3580401"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)71945-1"},{"key":"e_1_2_1_27_1","volume-title":"Workshop on the Semantics of Programming Languages, Abstracts and Notes. Programming Methodology Group, Chalmers Univ. Technology and Univ. G\u00f6teborg.","author":"Martin-L\u00f6f Per","year":"1983","unstructured":"Per Martin-L\u00f6f. 1983. The domain interpretation of type theory. In Workshop on the Semantics of Programming Languages, Abstracts and Notes. Programming Methodology Group, Chalmers Univ. Technology and Univ. G\u00f6teborg."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52335-9_54"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78499-9_25"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1048"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2001.932499"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796809990293"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796812000044"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190315.1190324"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2491978"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796808006758"},{"key":"e_1_2_1_37_1","volume-title":"Liquid Haskell: Haskell as a theorem prover","author":"Vazou Niki","year":"2016","unstructured":"Niki Vazou. 2016. Liquid Haskell: Haskell as a theorem prover. University of California, San Diego. https:\/\/goto.ucsd.edu\/~nvazou\/thesis\/main.pdf"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158141"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500599"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3110275"},{"key":"e_1_2_1_41_1","unstructured":"Robert Wright Michel Steuwer and Ohad Kammar. 2022. Idris2-Table: evaluating dependently-typed tables with the Brown Benchmark for Table Types (Extended Abstract). Talk based on library https:\/\/github.com\/madman-bob\/idris2-table"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3371119"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3607852","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3607852","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3607852","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:06Z","timestamp":1750178226000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3607852"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,30]]},"references-count":42,"journal-issue":{"issue":"ICFP","published-print":{"date-parts":[[2023,8,30]]}},"alternative-id":["10.1145\/3607852"],"URL":"https:\/\/doi.org\/10.1145\/3607852","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,30]]},"assertion":[{"value":"2023-08-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}