{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T04:49:17Z","timestamp":1683866957576},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5323,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1999]]},"DOI":"10.1016\/s1571-0661(04)00099-4","type":"journal-article","created":{"date-parts":[[2004,2,5]],"date-time":"2004-02-05T10:34:35Z","timestamp":1075977275000},"page":"1-2","source":"Crossref","is-referenced-by-count":2,"title":["Process Realizability"],"prefix":"10.1016","volume":"23","author":[{"given":"Samson","family":"Abramsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00099-4_NEWBIB1","doi-asserted-by":"crossref","unstructured":"S. Abramsky, S. Gay and R. Nagarajan. Interaction Categories and the Foundations of Typed Concurrent Programming. In Proceedings of the 1994 Marktoberdorf Summer School on Deductive Program Design. M. Broy, ed. Springer-Verlag 1996, 35\u2013113.","DOI":"10.1007\/978-3-642-61455-2_10"},{"key":"10.1016\/S1571-0661(04)00099-4_NEWBIB2","doi-asserted-by":"crossref","unstructured":"S. Abranmsky, S. Gay and R. Nagarajan. Specification Structures and Propositions-as-Types for Concurrency. In Logic for Concurrency: Structure vs. Automata-Proceedings of the VIIIth Banff Higher-Order Workshop. G. Birtwistle, and F. Moller, eds. Springer-Verlag 1996, 5\u201340.","DOI":"10.1007\/3-540-60915-6_2"},{"key":"10.1016\/S1571-0661(04)00099-4_NEWBIB3","doi-asserted-by":"crossref","unstructured":"S. Abramsky, and P.-A. Melli\u00e8s. Concurrent Games and Full Completeness. In Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Scoeity, 1999.","DOI":"10.1109\/LICS.1999.782638"},{"issue":"1","key":"10.1016\/S1571-0661(04)00099-4_NEWBIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear Logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00099-4_NEWBIB5","series-title":"Communication and Concurrency","author":"Milner","year":"1989"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104000994?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104000994?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T12:31:02Z","timestamp":1585571462000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104000994"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999]]}},"alternative-id":["S1571066104000994"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00099-4","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}