{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:11:54Z","timestamp":1761610314038,"version":"build-2065373602"},"reference-count":40,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"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":3923,"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":[[2002,11]]},"DOI":"10.1016\/s1571-0661(04)80500-0","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"47-69","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["A categorical framework for typing CCS-style process communication"],"prefix":"10.1016","volume":"68","author":[{"given":"Ralf","family":"Schweimeier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Retracing some paths in process algebra, in: Proc. CONCUR, 1996.","DOI":"10.1007\/3-540-61604-7_44"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB2","doi-asserted-by":"crossref","unstructured":"Abramsky S., S. Gay and R. Nagarajan, Interaction categories and the foundations of typed concurrent programming, in: Deductive Program Design: Proceedings of the 1994 Marktoberdorf Summer School (1996).","DOI":"10.1007\/978-3-642-61455-2_10"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB3","doi-asserted-by":"crossref","unstructured":"Abramsky S., S. Gay and R. Nagarajan, A type-theoretic approach to deadlock-freedom of asynchronous systems, in: Proc. TACS, 1997.","DOI":"10.1007\/BFb0014557"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB4","doi-asserted-by":"crossref","unstructured":"B\u00e9nabou J., Introduction to bicategories, in: Reports of the Midwest Category Seminar, LNM 47, Springer, 1967 pp. 1\u201377.","DOI":"10.1007\/BFb0074299"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB5","doi-asserted-by":"crossref","unstructured":"Brown C. and A. Jeffrey, Allegories of circuits, in: Proc. LFCS, 1994.","DOI":"10.1007\/3-540-58140-5_7"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB6","unstructured":"Bruni R. and F. Gadducci, Some algebraic laws for spans (and their connections with multirelations), in: Proc. of RelMiS 2001, Relational Methods in Software, Electronic Notes in Theoretical Computer Science 44 2001."},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB7","doi-asserted-by":"crossref","unstructured":"Bruni R., F. Gadducci and U. Montanari, Normal forms for partitions and relations, in: J. Fiadeiro, editor, Proceedings of WADT'98, 13th Workshop on Recent Trends in Algebraic Development Techniques, LNCS 1589 (1999), pp. 31\u201347.","DOI":"10.1007\/3-540-48483-3_3"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB8","doi-asserted-by":"crossref","unstructured":"Bruni R., F. Gadducci and U. Montanari, Normal forms for algebras of connections, Theoretical Computer Science (2002), to appear.","DOI":"10.1016\/S0304-3975(01)00318-8"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB9","doi-asserted-by":"crossref","unstructured":"Cattani, G. L., I. Stark and G. Winskel, Presheaf models for the \u03c0-calculus, in: Proc. CTCS, 1997.","DOI":"10.7146\/brics.v4i34.18960"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB10","doi-asserted-by":"crossref","unstructured":"Cattani, G. L. and G. Winskel, Presheaf models for concurrency, in: Proc. CSL, 1996.","DOI":"10.7146\/brics.v3i35.20017"},{"year":"1993","series-title":"\u201cCategories for Types\u201d","author":"Crole","key":"10.1016\/S1571-0661(04)80500-0_NEWBIB11"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB12","unstructured":"Crole R., S. Gay and R. Nagarajan, An internal language for interaction categories, in: Theory and Formal Methods 1994: Proceedings of the Second Imperial College Department of Computing Workshop on Theory and Formal Methods (1995)."},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB13","unstructured":"Fiore M., G. Plotkin and D. Turi, Abstract syntax and variable binding, in: Proc. LICS, 1999."},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB14","series-title":"Proof, Language and Interaction: Essays in Honour of Robin Milner","article-title":"The tile model","author":"Gadducci","year":"2000"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0304-3975(98)00355-7","article-title":"Closed action calculi","volume":"228","author":"Gardner","year":"1999","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB16","doi-asserted-by":"crossref","unstructured":"Gardner P. and L. Wischik, Explicit fusions, in: Proc. MFCS, 2000.","DOI":"10.1007\/3-540-44612-5_33"},{"year":"1999","series-title":"\u201cCategorical Logic and Type Theory,\u201d","author":"Jacobs","key":"10.1016\/S1571-0661(04)80500-0_NEWBIB17"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB18","unstructured":"Jeffrey A., Flow graphs and semantics of programs, Technical Report 98\u2013004, CTI, DePaul University (1998). URL http:\/\/fpl.cs.depaul.edu\/ajeffrey\/premon\/"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB19","doi-asserted-by":"crossref","DOI":"10.1017\/S0305004100074338","article-title":"Traced monoidal categories","volume":"119","author":"Joyal","year":"1996","journal-title":"Math. Proc. Camb. Phil. Soc"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB20","doi-asserted-by":"crossref","DOI":"10.1016\/0022-4049(80)90101-2","article-title":"Coherence for compact closed categories","volume":"19","author":"Kelly","year":"1980","journal-title":"Journal of Pure and Applied Algebra"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB21","doi-asserted-by":"crossref","unstructured":"Kobayashi N., Type systems for concurrent processes: From deadlock-freedom to livelock-freedom, time-boundedness, in: Proc. TCS, 2000.","DOI":"10.1007\/3-540-44929-9_27"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB22","doi-asserted-by":"crossref","unstructured":"Kobayashi N., B. Pierce and D. Turner, Linearity and the pi-calculus, in: Proc. POPL, 1996.","DOI":"10.1145\/237721.237804"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB23","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":"\u201cCommunication and Concurrency,\u201d","author":"Milner","key":"10.1016\/S1571-0661(04)80500-0_NEWBIB24"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB25","unstructured":"Milner R., The polyadic \u03c0-calculus: a tutorial, in: Proceedings of the International Summer School on Logic and Algebra of Specification (1991)."},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB26","unstructured":"Milner R., Action calculi V: Reflexive action calculi, Manuscript (1994). URL ftp:\/\/ftp.cl.cam.ac.uk\/users\/rm135\/ac5.ps.Z"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB27","doi-asserted-by":"crossref","DOI":"10.1007\/BF03036472","article-title":"Calculi for interaction","volume":"33","author":"Milner","year":"1996","journal-title":"Acta Informatica"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A calculus of mobile processes I + II","volume":"100","author":"Milner","year":"1992","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB29","unstructured":"Parrow J. and B. Victor, The fusion calculus: Expressiveness and symmetry in mobile processes, in: Proc. LICS, 1998."},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB30","doi-asserted-by":"crossref","DOI":"10.1017\/S096012950007002X","article-title":"Typing and subtyping for mobile processes","volume":"6","author":"Pierce","year":"1996","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB31","unstructured":"Reppy J., \u201cHigher-Order Concurrency,\u201d Ph.D. thesis, Cornell University (1992), Computer Science Technical Report 92\u20131285."},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB32","doi-asserted-by":"crossref","unstructured":"Riely J. and M. Hennessy, Trust and partial typing in open systems of mobile agents, in: Proc. POPL, 1999.","DOI":"10.1145\/292540.292551"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB33","unstructured":"Schweimeier R., \u201cCategorical and Graphical Models of Programming Languages,\u201d D. Phil. Thesis, University of Sussex, UK (2001)."},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB34","doi-asserted-by":"crossref","unstructured":"Schweimeier R. and A. Jeffrey, A categorical and graphical treatment of closure conversion, in: Proc. MFPS 15, Electronic Notes in Theoretical Computer Science 20, 1999.","DOI":"10.1016\/S1571-0661(04)80090-2"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB35","doi-asserted-by":"crossref","unstructured":"Selinger P., First-order axioms for asynchrony, in: Proc. CONCUR, 1997.","DOI":"10.1007\/3-540-63141-0_26"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB36","doi-asserted-by":"crossref","unstructured":"Selinger P., Categorical structure of asynchrony, in: Proc. MFPS 15, Electronic Notes in Theoretical Computer Science 20, 1999.","DOI":"10.1016\/S1571-0661(04)80073-2"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB37","series-title":"Handbook of Logic in Computer Science","article-title":"Models for concurrency","author":"Winskel","year":"1995"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB38","unstructured":"Wischik L. and P. Gardner, Symmetric action calculi, in: Proc. EXPRESS, 1999."},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB39","doi-asserted-by":"crossref","unstructured":"Yoshida N., Graph types for monadic mobile processes, in: Proc. FST & TCS, 1996.","DOI":"10.1007\/3-540-62034-6_64"},{"key":"10.1016\/S1571-0661(04)80500-0_NEWBIB40","unstructured":"Yoshida N. and M. Hennessy, Assigning types to processes, in: Proc. LICS, 2000."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805000?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805000?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:05:59Z","timestamp":1761609959000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805000"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S1571066104805000"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80500-0","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A categorical framework for typing CCS-style process communication","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)80500-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}