{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:11:53Z","timestamp":1775873513653,"version":"3.50.1"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,26]]},"DOI":"10.1109\/lics56636.2023.10175777","type":"proceedings-article","created":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T17:18:23Z","timestamp":1689355103000},"page":"1-14","source":"Crossref","is-referenced-by-count":4,"title":["A Metalanguage for Cost-Aware Denotational Semantics"],"prefix":"10.1109","author":[{"given":"Yue","family":"Niu","sequence":"first","affiliation":[{"name":"Carnegie Mellon University,Computer Science Department,Pittsburgh,USA"}]},{"given":"Robert","family":"Harper","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University,Computer Science Department,Pittsburgh,USA"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0012801"},{"key":"ref12","first-page":"85","article-title":"Slot games: A quantitative model of computation","author":"ghica","year":"2005"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-4049(96)00164-8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0084217"},{"key":"ref31","article-title":"Sheaf semantics of termination-insensitive noninterference","volume":"228","author":"sterling","year":"2022","journal-title":"7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022)"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/10703163_22"},{"key":"ref11","first-page":"543","author":"oles","year":"1986","journal-title":"Type Algebras Functor Categories and Block Structure"},{"key":"ref10","first-page":"345","article-title":"The Essence of ALGOL","author":"reynolds","year":"1981","journal-title":"Algorithmic Languages Proceedings of the International Symposium on Algorithmic Languages"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3498670"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","article-title":"Lcf considered as a programming language","volume":"5","author":"plotkin","year":"1977","journal-title":"Theoretical Computer Science"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/S096012959900273X"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63172-0_36"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2015.12.020"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934516"},{"key":"ref24","article-title":"Realizability and compositional compiler correctness for a polymorphic language","author":"benton","year":"2010","journal-title":"Microsoft Research"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3354166.3354181"},{"key":"ref26","article-title":"Domains and denotational semantics: History, accomplishments and open problems","author":"jung","year":"1996"},{"key":"ref25","first-page":"1","volume":"8552","author":"amadio","year":"2014","journal-title":"Certified complexity (cerco)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3341689"},{"key":"ref22","first-page":"15","article-title":"Verified Compilers for a Multi-Language World","volume":"32","author":"ahmed","year":"2015","journal-title":"1st Summit on Advances in Programming Languages (SNAPL 2015)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54833-8_8"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-011-9219-0"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1017\/S095679681500009X"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54458-7_31"},{"key":"ref8","volume":"1","author":"o\u2019hearn","year":"1997","journal-title":"Algol-like languages"},{"key":"ref7","article-title":"Recurrence extraction for functional programs through call-by-push-value","volume":"4","author":"kavvos","year":"2019","journal-title":"Proceedings of the ACM on Programming Languages"},{"key":"ref9","volume":"2","author":"o\u2019hearn","year":"1997","journal-title":"Algol-like languages"},{"key":"ref4","article-title":"The fire triangle: How to mix substitution, dependent elimination, and effects","volume":"4","author":"p\u00e9drot","year":"2019","journal-title":"Proceedings of the ACM on Programming Languages"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139342131"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2784731.2784749"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3474834"}],"event":{"name":"2023 38th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Boston, MA, USA","start":{"date-parts":[[2023,6,26]]},"end":{"date-parts":[[2023,6,29]]}},"container-title":["2023 38th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10175635\/10175671\/10175777.pdf?arnumber=10175777","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T17:58:56Z","timestamp":1690912736000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10175777\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,26]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/lics56636.2023.10175777","relation":{},"subject":[],"published":{"date-parts":[[2023,6,26]]}}}