{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T08:27:15Z","timestamp":1770280035052,"version":"3.49.0"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/lics.2019.8785683","type":"proceedings-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T01:15:55Z","timestamp":1565054155000},"page":"1-13","source":"Crossref","is-referenced-by-count":14,"title":["A Type Theory for Defining Logics and Proofs"],"prefix":"10.1109","author":[{"given":"Brigitte","family":"Pientka","sequence":"first","affiliation":[]},{"given":"David","family":"Thibodeau","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Abel","sequence":"additional","affiliation":[]},{"given":"Francisco","family":"Ferreira","sequence":"additional","affiliation":[]},{"given":"Rebecca","family":"Zucchini","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1999.782616"},{"key":"ref11","first-page":"19:1","article-title":"Index-stratified types","author":"jacob-rao","year":"2018","journal-title":"3rd International Conference on Formal Structures for Computation and Deduction (FSCD'18) LIPIcs"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1352582.1352591"},{"key":"ref13","author":"norell","year":"2007","journal-title":"Towards A Practical Programming Language Based on Dependent Type Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328483"},{"key":"ref15","first-page":"273","article-title":"Structural recursion over contextual objects","author":"pientka","year":"2015","journal-title":"13th International Conference on Typed Lambda Calculi and Applications (TLCA'15)"},{"key":"ref16","author":"pientka","year":"2019","journal-title":"Cocon Computation in contextual type theory"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21401-6_18"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1389449.1389469"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14203-1_2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2503887.2503889"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07964-5"},{"key":"ref6","article-title":"Primitive recursion for higher order abstract syntax with dependent types","author":"despeyroux","year":"1999","journal-title":"Workshop on Intuitionistic Modal Logics and Applications (IMLA'99)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014049"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/138027.138060"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-62688-3_34"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-8(1:29)2012"},{"key":"ref1","first-page":"23:1","article-title":"Decidability of conversion for type theory in type theory","author":"abel","year":"2018","journal-title":"35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'18) PACMPL 2(POPL)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1042038.1042041"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/0205037"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292560"},{"key":"ref21","first-page":"341","article-title":"A normalization proof for an impredicative type system with large elimination over integers","author":"werner","year":"1992","journal-title":"Proc Int Workshop Types Proofs Programs (TYPES)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00062-5"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Vancouver, BC, Canada","start":{"date-parts":[[2019,6,24]]},"end":{"date-parts":[[2019,6,27]]}},"container-title":["2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8765678\/8785654\/08785683.pdf?arnumber=8785683","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:20:37Z","timestamp":1658262037000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785683\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785683","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}