{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:31:31Z","timestamp":1730280691948,"version":"3.28.0"},"reference-count":13,"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.8785657","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":9,"title":["Higher-Kinded Data Types: Syntax and Semantics"],"prefix":"10.1109","author":[{"given":"Patricia","family":"Johann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Polonsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"297","article-title":"Foundations for structured programming with GADTs","author":"johann","year":"2008","journal-title":"Principles of Programming Languages"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00168-5"},{"key":"ref12","first-page":"227","article-title":"Indexed containers","author":"morris","year":"2009","journal-title":"Logic in Computer Science"},{"journal-title":"Category Theory in Context","year":"2016","author":"riehl","key":"ref13"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511600579"},{"key":"ref3","first-page":"589","article-title":"Free algebras and automata realizations in the language of categories","volume":"15","author":"ad\u00e1mek","year":"1974","journal-title":"Commentations Mathematicae Universitatis Carolinae"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0059396"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(89)90161-8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-006-8748-4"},{"key":"ref7","first-page":"210","article-title":"Well-founded trees and dependent polynomial functors","author":"gambino","year":"2003","journal-title":"TYPES"},{"year":"0","key":"ref2"},{"year":"0","key":"ref1"},{"key":"ref9","first-page":"59","article-title":"A foundation for GADTs and inductive families: Dependent polynomial functor approach","author":"hamama","year":"2011","journal-title":"Workshop on Generic Programming"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2019,6,24]]},"location":"Vancouver, BC, Canada","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\/08785657.pdf?arnumber=8785657","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:18:53Z","timestamp":1658261933000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785657\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785657","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}