{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:21:54Z","timestamp":1776316914501,"version":"3.50.1"},"reference-count":39,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,26]]},"DOI":"10.1109\/lics56636.2023.10175778","type":"proceedings-article","created":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T13:18:23Z","timestamp":1689340703000},"page":"1-13","source":"Crossref","is-referenced-by-count":7,"title":["Fully Abstract Normal Form Bisimulation for Call-by-Value PCF"],"prefix":"10.1109","author":[{"given":"Vasileios","family":"Koutavas","sequence":"first","affiliation":[{"name":"Trinity College Dublin,Dublin,Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Yang","family":"Lin","sequence":"additional","affiliation":[{"name":"Trinity College Dublin,Dublin,Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikos","family":"Tzevelekos","sequence":"additional","affiliation":[{"name":"Queen Mary University of London,London,UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","first-page":"264","article-title":"Operational nominal game semantics","volume":"9034","author":"jaber","year":"2015","journal-title":"Foundations of Software Science and Computation Structures - 18th International Conference FoSSaCS 2015 Held as Part of ETAPS 2015 LNCS"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1042"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2917"},{"key":"ref34","article-title":"Enhancements of the bisimulation proof method","author":"pous","year":"2012","journal-title":"Advanced Topics in Bisimulation and Coinduction CUP"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.09.023"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190244"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02059-9_3"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1889997.1890002"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1103"},{"key":"ref30","first-page":"253","article-title":"Hereditarily sequential functionals","volume":"813","author":"nickau","year":"1994","journal-title":"Logical Foundations of Computer Science Third International Symposium LFCS'94 St Petersburg Russia July 11-14 1994 Proceedings LNCS"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0008"},{"key":"ref33","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139084673","author":"pitts","year":"2013","journal-title":"Nominal Sets Names and Symmetry in Computer Science"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00039-0"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055063"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57887-0_87"},{"key":"ref1","first-page":"65","author":"abramsky","year":"1990","journal-title":"The Lazy Lambda Calculus"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/11693024_11"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284325"},{"key":"ref16","first-page":"178","article-title":"From bounded checking to verification of equivalence via symbolic up-to techniques","author":"koutavas","year":"2022","journal-title":"Tools and Algorithms for the Construction and Analysis of Systems"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.12.032"},{"key":"ref19","first-page":"667","article-title":"A fully abstract trace semantics for general references","author":"laird","year":"2007","journal-title":"Automata Languages and Programming"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111050"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-74915-8_23","article-title":"Typed normal form bisimulation","author":"lassen","year":"2007","journal-title":"Computer Science Logic"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.11.068"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00194-8"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2008.26"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2008.26"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2005.15"},{"key":"ref21","first-page":"346","article-title":"Bisimulation in untyped lambda calculus:: Böhm trees and bisimulation up to context","volume":"20","author":"lassen","year":"1999","journal-title":"MFPS XV Mathematical Foundations of Progamming Semantics Fifteenth Conference"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90053-6"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0615-9"},{"key":"ref29","article-title":"Lambda Calculus Models of Programming Languages","author":"morris","year":"1968","journal-title":"Ph D thesis"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2012.08.013"},{"key":"ref7","article-title":"A concrete representation of observational equivalence for PCF","author":"churchill","year":"2010"},{"key":"ref9","article-title":"Functional programming and input\/output","author":"gordon","year":"1992","journal-title":"Ph D thesis"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/504709.504712"},{"key":"ref3","first-page":"1","article-title":"Call-by-value games","volume":"1414","author":"abramsky","year":"1997","journal-title":"Computer Science Logic 11th International Workshop CSL '97 Annual Conference of the EACSL LNCS"},{"key":"ref6","article-title":"A complete normal-form bisimilarity for state","author":"biernacki","year":"2019","journal-title":"FOSSACS 2019 Held as Part of ETAPS 2019"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29822-6_7"}],"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\/10175778.pdf?arnumber=10175778","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T13:59:16Z","timestamp":1690898356000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10175778\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,26]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/lics56636.2023.10175778","relation":{},"subject":[],"published":{"date-parts":[[2023,6,26]]}}}