{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:17:11Z","timestamp":1725506231424},"reference-count":18,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/lics.1999.782612","type":"proceedings-article","created":{"date-parts":[[2003,1,20]],"date-time":"2003-01-20T17:29:30Z","timestamp":1043083770000},"page":"174-182","source":"Crossref","is-referenced-by-count":2,"title":["Full abstraction and universality via realisability"],"prefix":"10.1109","author":[{"given":"M.","family":"Marz","sequence":"first","affiliation":[]},{"given":"A.","family":"Rohr","sequence":"additional","affiliation":[]},{"given":"T.","family":"Streicher","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Full completeness effectively almost-everywhere copycat strategies and the longley conjecture","year":"1998","author":"nickau","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1103"},{"journal-title":"Some notes on inductive and co-inductive techniques in the semantics of functional programs","year":"1994","author":"pitts","key":"ref12"},{"year":"0","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1997.614953"},{"key":"ref15","first-page":"403","author":"scott","year":"1980","journal-title":"To H B Curry Essays on combinatory logic lambda calculus and formalism"},{"journal-title":"Progress in Theoretical Computer Science","year":"1991","author":"streicher","key":"ref16"},{"journal-title":"Full abstraction via realisability","year":"1998","author":"streicher","key":"ref17"},{"journal-title":"A combinatorry algebra for sequential functionals of finite type","year":"1997","author":"van oosten","key":"ref18"},{"journal-title":"Typed Lambda Calculi and Applications","year":"1999","author":"levy","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0037109"},{"journal-title":"Realizability models for sequential computation","year":"1998","author":"longley","key":"ref6"},{"journal-title":"Realizability Toposes and Language Semantics","year":"1994","author":"longley","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129597002387"},{"journal-title":"The sequentially realizable functionals","year":"1998","author":"longley","key":"ref7"},{"journal-title":"Foundations of Computing","year":"1992","author":"gunter","key":"ref2"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-57887-0_87","author":"abramsky","year":"1994","journal-title":"Theoretical Aspects of Computer Software"},{"journal-title":"A fully abstract model for sequential computation","year":"1998","author":"marz","key":"ref9"}],"event":{"name":"Proceedings. 14th Symposium on Logic in Computer Science","acronym":"LICS-99","location":"Trento, Italy"},"container-title":["Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6352\/16964\/00782612.pdf?arnumber=782612","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T17:25:31Z","timestamp":1497547531000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/782612\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/lics.1999.782612","relation":{},"subject":[]}}