{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:32:17Z","timestamp":1730280737954,"version":"3.28.0"},"reference-count":44,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"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":[[2021,6,29]]},"DOI":"10.1109\/lics52264.2021.9470567","type":"proceedings-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T20:14:07Z","timestamp":1625688847000},"page":"1-13","source":"Crossref","is-referenced-by-count":0,"title":["A Compositional Cost Model for the \u03bb-calculus"],"prefix":"10.1109","author":[{"given":"James","family":"Laird","sequence":"first","affiliation":[{"name":"University of Bath,Department of Computer Science"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/0205036"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96712"},{"key":"ref33","first-page":"1","article-title":"Revisiting call-by-value Böhm trees in light of their Taylor expansion","volume":"16","author":"kerinec","year":"2020","journal-title":"Logical Methods in Computer Science"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/173262.155113"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)71120-0"},{"key":"ref30","article-title":"Computing with Böhm trees","volume":"45","author":"david","year":"2001","journal-title":"Fundamenta Informaticae"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(87)90017-7"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511983504"},{"key":"ref34","article-title":"Games and full abstraction for a functional metalanguage with recursive types","author":"mccusker","year":"1996","journal-title":"Ph D Dissertation"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.01.044"},{"key":"ref40","first-page":"361","article-title":"A syntactic characterization of the equality in some models for the untyped lambda-calculus","volume":"12","author":"hyland","year":"1976","journal-title":"J LMS"},{"key":"ref11","first-page":"105","article-title":"An invariant cost model for the lambda calculus","author":"lago","year":"2006","journal-title":"Proceedings of CiE 2006"},{"key":"ref12","first-page":"22","article-title":"On the invariance of the unitary cost model for head reduction","author":"accattoli","year":"2012","journal-title":"Proceedings of RTA ’12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603105"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500606"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3341718"},{"key":"ref16","article-title":"Semantics and pragmatics of the lambda-calculus","author":"wadsworth","year":"1971","journal-title":"Ph D Dissertation"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/115865.115890"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.03.058"},{"key":"ref19","article-title":"Lazy specialization","author":"thyer","year":"1999","journal-title":"Ph D Dissertation"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46678-0_4"},{"key":"ref4","first-page":"1","article-title":"Machine models and simulations","author":"van emde boas","year":"1991","journal-title":"Handbook of Theoretical Computer Science"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2005026"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2013.36"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96711"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129598002631"},{"journal-title":"The Lambda Calculus Its Syntax and Semantics","year":"1984","author":"barendregt","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/232629.232639"},{"key":"ref7","first-page":"289","article-title":"What is an efficient implementation of the ?-calculus","author":"frandsen","year":"1991","journal-title":"Proceedings of FPCA ’91"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040313"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.2869"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/32.2.98"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1996.561456"},{"key":"ref22","article-title":"The (in)efficiency of interaction","author":"accattoli","year":"2021","journal-title":"Proceedings of POPL ’21"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19805-2_23"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-17945-3_8"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380090105"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(72)90034-0"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2917"},{"key":"ref44","first-page":"198","article-title":"Modal Logics for Nominal Transition Systems","volume":"42","author":"parrow","year":"2015","journal-title":"26th International Conference on Concurrency Theory (CONCUR 2015)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1017\/S096012950400427X"},{"key":"ref43","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139084673","author":"pitts","year":"2013","journal-title":"Nominal Sets Names and Symmetry in Computer Science"},{"key":"ref25","article-title":"An inverse of the evaluation functional for typed ?-calculus","author":"berger","year":"1991","journal-title":"Proceedings of LICS ’91"}],"event":{"name":"2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2021,6,29]]},"location":"Rome, Italy","end":{"date-parts":[[2021,7,2]]}},"container-title":["2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9470497\/9470501\/09470567.pdf?arnumber=9470567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T23:01:55Z","timestamp":1659481315000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9470567\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/lics52264.2021.9470567","relation":{},"subject":[],"published":{"date-parts":[[2021,6,29]]}}}