{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:53:10Z","timestamp":1753894390543,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2022,9,15]],"date-time":"2022-09-15T00:00:00Z","timestamp":1663200000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>In their paper \"A Functional Abstraction of Typed Contexts\", Danvy and\nFilinski show how to derive a monomorphic type system of the shift and reset\noperators from a CPS semantics. In this paper, we show how this method scales\nto Felleisen's control and prompt operators. Compared to shift and reset,\ncontrol and prompt exhibit a more dynamic behavior, in that they can manipulate\na trail of contexts surrounding the invocation of previously captured\ncontinuations. Our key observation is that, by adopting a functional\nrepresentation of trails in the CPS semantics, we can derive a type system that\nencodes all and only constraints imposed by the CPS semantics.<\/jats:p>","DOI":"10.46298\/lmcs-18(3:34)2022","type":"journal-article","created":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T07:35:56Z","timestamp":1663572956000},"source":"Crossref","is-referenced-by-count":0,"title":["A Functional Abstraction of Typed Invocation Contexts"],"prefix":"10.46298","volume":"Volume 18, Issue 3","author":[{"given":"Youyou","family":"Cong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chiaki","family":"Ishio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaho","family":"Honda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenichi","family":"Asai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2022,9,15]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/10044\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/10044\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:20:26Z","timestamp":1687292426000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/8581"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,15]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-18(3:34)2022","relation":{"has-preprint":[{"id-type":"arxiv","id":"2110.07349v3","asserted-by":"subject"},{"id-type":"arxiv","id":"2110.07349v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2110.07349v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2110.07349","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2110.07349","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2022,9,15]]},"article-number":"8581"}}