{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:31Z","timestamp":1761610111315,"version":"build-2065373602"},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6784,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1995]]},"DOI":"10.1016\/s1571-0661(04)80005-7","type":"journal-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T15:29:25Z","timestamp":1096385365000},"page":"66-90","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Categories for synchrony and asynchrony"],"prefix":"10.1016","volume":"1","author":[{"given":"J.R.B.","family":"Cockett","sequence":"first","affiliation":[]},{"given":"D.A.","family":"Spooner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80005-7_NEWBIB1","series-title":"Theory and Formal Methods Workshop","article-title":"Interaction Categories (Extended Abstract)","author":"Abramsky","year":"1993"},{"key":"10.1016\/S1571-0661(04)80005-7_NEWBIB2","series-title":"A Classical Mind: Essays in Honour of C. A. R. Hoare","article-title":"Interaction Categories and communicating sequential processes","author":"Abramsky","year":"1994"},{"key":"10.1016\/S1571-0661(04)80005-7_NEWBIB3","unstructured":"Abramsky S., S. Gay and R. Nagarajan, Constructing and verifying typed processes. Unpublished, 1993."},{"key":"10.1016\/S1571-0661(04)80005-7_NEWBIB4","doi-asserted-by":"crossref","unstructured":"Abramsky S., and R. Jagadeesan, Games and Full Completeness for Multiplicative Linear Logic. Imperial College Technical Report DoC 92\/24, 1992.","DOI":"10.1007\/3-540-56287-7_113"},{"key":"10.1016\/S1571-0661(04)80005-7_NEWBIB5","doi-asserted-by":"crossref","unstructured":"Abramsky S., Jagadeesan R., and Malacaria P., Full abstraction for PCF (extended abstract), In M. Hagiya and J. C. Mitchel (eds), Theoretical Aspects of Computer Software. International Symposium TACS'94, Lecture Notes in Computer Science 789, Springer-Verlag, 1994","DOI":"10.1007\/3-540-57887-0_87"},{"key":"10.1016\/S1571-0661(04)80005-7_NEWBIB6","article-title":"Introduction to bicategories","volume":"47","author":"B\u00e9nabou","year":"1967"},{"key":"10.1016\/S1571-0661(04)80005-7_NEWBIB7","unstructured":"Carboni A., S. Lack and R.F.C. Walters, Introduction to extensive and distributive categories. Manuscript, March 1992."},{"key":"10.1016\/S1571-0661(04)80005-7_NEWBIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-4049(90)90121-W","article-title":"List-arithmetic open categories: Locoi","volume":"66","author":"Cockett","year":"1990","journal-title":"Journal of Pure and Applied Algebra"},{"key":"10.1016\/S1571-0661(04)80005-7_NEWBIB9","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1017\/S0960129500000232","article-title":"Introduction to distributive categories","volume":"3","author":"Cockett","year":"1993","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(04)80005-7_NEWBIB10","doi-asserted-by":"crossref","unstructured":"Cockett J.R.B. and D.A. Spooner, SProc Categorically. proceedings of CONCUR '94. Springer Verlag, 1994.","DOI":"10.1007\/978-3-540-48654-1_13"},{"key":"10.1016\/S1571-0661(04)80005-7_NEWBIB11","unstructured":"Cockett J.R.B. and D.A. Spooner, Constructing Process Categories. Available by ftp as \/pub\/papers\/categories\/interaction\/cpc.ps.Z on ftp.cpsc.ucalgary.ca."},{"key":"10.1016\/S1571-0661(04)80005-7_NEWBIB12","doi-asserted-by":"crossref","unstructured":"Joyal A., M. Nielsen and G. Winskel, Bisimulation and open maps. Proceedings of the Eighth Symposium on Logic in Computer Science, IEEE, 1993.","DOI":"10.7146\/brics.v1i7.21663"},{"key":"10.1016\/S1571-0661(04)80005-7_NEWBIB13","series-title":"Applications of Categories in Computer Science","article-title":"On clubs and data-type constructors","author":"Kelly","year":"1992"},{"key":"10.1016\/S1571-0661(04)80005-7_NEWBIB14","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","article-title":"Calculi for synchrony and asynchrony","volume":"25","author":"Milner","year":"1983","journal-title":"Theoretical Computer Science"},{"year":"1989","series-title":"Communication and Concurrency","author":"Milner","key":"10.1016\/S1571-0661(04)80005-7_NEWBIB15"},{"key":"10.1016\/S1571-0661(04)80005-7_NEWBIB16","doi-asserted-by":"crossref","unstructured":"Mulry, P.S., Lifting Theorems for Kleisli Categories. Mathematical Foundations of Programming Semantics, LNCS 802, Springer Verlag, 1994","DOI":"10.1007\/3-540-58027-1_15"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104800057?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104800057?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:03:31Z","timestamp":1761609811000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104800057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":16,"alternative-id":["S1571066104800057"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80005-7","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Categories for synchrony and asynchrony","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80005-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}