{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:29:59Z","timestamp":1725467399176},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634553"},{"type":"electronic","value":"9783540695523"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0026986","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T06:12:36Z","timestamp":1132380756000},"page":"147-158","source":"Crossref","is-referenced-by-count":4,"title":["Specifying interaction categories"],"prefix":"10.1007","author":[{"given":"D.","family":"Pavlovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Abramsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"S. Abramsky, S.J. Gay and R. Nagarajan, Interaction categories and the foundations of the typed concurrent programming. In: Deductive Program Design: Proceedings of the 1994 Marktoberdorf International Summer School, (Springer 1996)","DOI":"10.1007\/978-3-642-61455-2_10"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"S. Abramsky, S.J. Gay and R. Nagarajan, Specification structures and propositions-as-types for concurrency. In: Logics for Concurrency: Structure vs. Automata. Proceedings of the VIIIth Banff Workshop, Lecture Notes in Computer Science(Springer 1996)","DOI":"10.1007\/3-540-60915-6_2"},{"key":"9_CR3","unstructured":"S. Abramsky and R. Jagadeesan, Games and full completeness for multiplicative linear logic, J. Symbolic Logic"},{"key":"9_CR4","unstructured":"S. Abramsky, R. Jagadeesan and P. Malacaria, Full abstraction for PCF, submitted (1996)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"M. Barr, \u22c6-Autonomous Categories, Lecture Notes in Mathematics 752 (Springer 1979)","DOI":"10.1007\/BFb0064579"},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1017\/S0960129500001274","volume":"1","author":"M. Barr","year":"1991","unstructured":"M. Barr, \u22c6-Autonomous categories and linear logic, Math. Structures Comput. Sci. 1\/2 (1991), 159\u2013178","journal-title":"Math. Structures Comput. Sci."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"J. B\u00e9nabou, Introduction to bicategories, in: Reports of the Midwest Category Seminar I, Lecture Notes in Mathematics 47 (Springer, 1967) 1\u201377","DOI":"10.1007\/BFb0074299"},{"key":"9_CR8","unstructured":"J. B\u00e9nabou, 2-dimensional limits and colimits of distributors, abstract of a talk given in Oberwolfach (1972)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"G.M. Bierman, What is a categorical model of intuitionistic linear logic?, in: Proceedings of Conference on Typed Lambda Calculus and Applications, M. Dezani Ciancaglini and G. Plotkin, eds., Lecture Notes in Computer Science 902 (Springer 1995)","DOI":"10.1007\/BFb0014046"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01622878","volume":"28","author":"V. Danos","year":"1989","unstructured":"V. Danos and L. Regnier, The structure of multiplicatives, Archive form Math. Logic 28 (1989) 181\u2013203","journal-title":"Archive form Math. Logic"},{"issue":"7","key":"9_CR11","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1080\/00927877608822127","volume":"4","author":"T. Fox","year":"1976","unstructured":"T. Fox, Coalgebras and cartesian categories, Comm. Algebra, 4\/7 (1976) 665\u2013667","journal-title":"Comm. Algebra"},{"key":"9_CR12","unstructured":"P.J. Freyd and A. Scedrov, Categories, Allegories, North-Holland Mathematical Library 39 (North-Holland, 1990)"},{"key":"9_CR13","unstructured":"A. Fleury and C. Retor\u00e9, The MIX rule, Unpublished note, 1990"},{"key":"9_CR14","unstructured":"J.-Y. Girard et al., Proofs and Types, Cambridge Tracts in Theoretical Computer Science 7 (Cambridge Univ. Press 1989)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"A. Grothendieck, Cat\u00e9gories fibr\u00e9es et descente, Expos\u00e9 VI, Rev\u00eatements Etales et Groupe Fondamental (SGAI), Lecture Notes in Mathematics 224 (Springer, 1971) 145\u2013194","DOI":"10.1007\/BFb0058662"},{"key":"9_CR16","unstructured":"G.M. Kelly, Basic Concepts of Enriched Category Theory, L.M.S. Lecture Notes 64 (Cambridge Univ. Press 1982)"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0022-4049(80)90101-2","volume":"19","author":"G.M. Kelly","year":"1980","unstructured":"G.M. Kelly and M.L. Laplaza, Coherence for compact closed categories, J. Pure Appl. Algebra 19 (1980) 193\u2013213","journal-title":"J. Pure Appl. Algebra"},{"key":"9_CR18","unstructured":"M. Makkai, Avoiding the axiom of choice in general category theory, to appear in J. Pure Appl. Algebra"},{"key":"9_CR19","unstructured":"D. Pavlovi\u0107, Categorical logic of concurrency and interaction I. Synchronous processes, in: Theory and Formal Methods of Computing 1994, C.L. Henkin et al., eds. (World Scientific 1995), 105\u2013141"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"D. Pavlovi\u00e9, Convenient categories of processes and simulations I: modulo strong bisimilarity, Category Theory and Computer Science '95, D.H. Pitt et al., eds., Lect. Notes in Comp. Science 953 (Springer, 1995), 3\u201324","DOI":"10.1007\/3-540-60164-3_17"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0022-4049(94)00054-M","volume":"99","author":"D. Pavlovi\u00e9","year":"1995","unstructured":"D. Pavlovi\u00e9, Maps I: relative to a factorisation system, J. Pure Appl. Algebra 99 (1995), 9\u201334; Maps II: Chasing diagrams in categorical proof theory, J. of the IGPL 2\/4(1996), 159\u2013194","journal-title":"J. Pure Appl. Algebra"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"R.A.G. Seely, Linear logic, *-autonomous categories and cofree coalgebras, in: J. Gray and A. Scedrov (eds.), Categories in Computer Science and Logic, Contemp. Math. 92 (Amer. Math. Soc., 1989), 371\u2013382","DOI":"10.1090\/conm\/092\/1003210"},{"key":"9_CR23","unstructured":"R. Street, Conduch\u00e9 functors, a hand written note, dated 15 October 1986, 4 pp. *** DIRECT SUPPORT *** A0008C33 00004"}],"container-title":["Lecture Notes in Computer Science","Category Theory and Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026986","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T21:58:25Z","timestamp":1586555905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026986"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634553","9783540695523"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0026986","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}