{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:20Z","timestamp":1761611300522},"publisher-location":"Berlin, Heidelberg","reference-count":46,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616047"},{"type":"electronic","value":"9783540706250"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61604-7_44","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:02:43Z","timestamp":1330293763000},"page":"1-17","source":"Crossref","is-referenced-by-count":45,"title":["Retracing some paths in process algebra"],"prefix":"10.1007","author":[{"given":"Samson","family":"Abramsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"S. Abramsky. Interaction categories (extended abstract). In Theory and Formal Methods '93, Workshops in Computer Science, pages 57\u201370. Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4471-3503-6_5"},{"key":"1_CR2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0304-3975(94)00103-0","volume":"135","author":"S. Abramsky","year":"1994","unstructured":"S. Abramsky. Proofs as processes. Theoretical Computer Science, 135:5\u20139, 1994.","journal-title":"Theoretical Computer Science"},{"key":"1_CR3","unstructured":"S. Abramsky. A game semantics for Idealized Parallel Algol. Unpublished lecture, 1995."},{"key":"1_CR4","unstructured":"S. Abramsky. Interaction categories and communicating sequential processes. In A. W. Roscoe, editor, A Classical Mind: Essays in Honour of C. A. R. Hoare, pages 1\u201315. Prentice Hall International, 1995."},{"key":"1_CR5","unstructured":"S. Abramsky. Axioms for full abstraction and full completeness. Submitted for publication, 1996."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"S. Abramsky. Semantics of interaction. In Proceedings of 1995 CLiCS Summer School, Isaac Newton Institute. Cambridge University Press, 1996. To appear.","DOI":"10.1007\/3-540-61064-2_24"},{"key":"1_CR7","unstructured":"P. Aczel. Non-well-founded sets. CSLI, 1988."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"S. Abramsky, S. Gay, and R. Nagarajan. Interaction categories and the foundations of typed concurrent programming. In Deductive program design: Proceedings of the 1994 Marktoberdorf International Summer School. Springer-Verlag, 1996. To appear.","DOI":"10.1007\/978-3-642-61455-2_10"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"S. Abramsky, S. Gay, and R. Nagarajan. Specification structures and propositions-as-types for concurrency. In Logics for Concurrency: Structure vs. Automata, Lecture Notes in Computer Science. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-60915-6_2"},{"issue":"2","key":"1_CR10","doi-asserted-by":"crossref","first-page":"543","DOI":"10.2307\/2275407","volume":"59","author":"S. Abramsky","year":"1994","unstructured":"S. Abramsky and R. Jagadeesan. Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic, 59(2):543\u2013574, 1994.","journal-title":"Journal of Symbolic Logic"},{"issue":"1","key":"1_CR11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1006\/inco.1994.1041","volume":"111","author":"S. Abramsky","year":"1994","unstructured":"S. Abramsky and R. Jagadeesan. New foundations for the geometry of interaction. Information and Computation, 111(1):53\u2013119, 1994. Conference version appeared in LiCS '92.","journal-title":"Information and Computation"},{"key":"1_CR12","unstructured":"S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Submitted for publication, 1996."},{"issue":"2","key":"1_CR13","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1145\/322307.322325","volume":"29","author":"M. A. Arbib","year":"1982","unstructured":"M. A. Arbib and E. G. Manes. The pattern-of-calls expansion is the canonical fixpoint for recursive definitions. Journal of the ACM, 29(2):577\u2013602, 1982.","journal-title":"Journal of the ACM"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"S. Abramsky and G. McCusker. Games and full abstraction for the lazy \u03bb-calculus. In Tenth Annual Symposium on Logic in Computer Science, pages 234\u2013243, 1995.","DOI":"10.1109\/LICS.1995.523259"},{"key":"1_CR15","unstructured":"S. Abramsky and G. McCusker. Full abstraction for Idealized Algol. To appear, 1996."},{"issue":"1","key":"1_CR16","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(93)90151-I","volume":"114","author":"M. Abadi","year":"1993","unstructured":"M. Abadi and G. Plotkin. A logical view of composition and refinement. Theoretical Computer Science, 114(1):3\u201330, 1993.","journal-title":"Theoretical Computer Science"},{"key":"1_CR17","unstructured":"M. Barr. Algebraically compact functors. Technical report, 1993."},{"key":"1_CR18","unstructured":"M. Barr. Terminal coalgebras for endofunctors on sets. Technical Report, 1993."},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"S. Bloom and Z. Esik. Iteration Theories. Springer-Verlag, 1993.","DOI":"10.1007\/978-3-642-78034-9"},{"key":"1_CR20","volume-title":"Technical Report TR25.125","author":"H. Beki\u0107","year":"1971","unstructured":"H. Beki\u0107. Towards a mathematical theory of processes. Technical Report TR25.125, IBM Laboratory, Vienna, 1971."},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"M. Giry. A categorical approach to probability theory. In Categorical Aspects of Topology and Analysis, volume 915 of Lecture Notes in Mathematics. Springer-Verlag, 1981.","DOI":"10.1007\/BFb0092872"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"J.-Y. Girard. Geometry of interaction I: interpretation of System F. In R. Ferro, editor, Logic Colloquium '88, pages 221\u2013260. North Holland, 1988.","DOI":"10.1016\/S0049-237X(08)70271-4"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"R. Grosu and K. St\u00d8len. A model for mobile point-to-point dataflow networks without channel sharing. Technical report, 1996.","DOI":"10.1007\/BFb0014336"},{"key":"1_CR24","unstructured":"M. Hasegawa. Traced computational models. Technical report, 1996."},{"key":"1_CR25","unstructured":"M. Hyland and C.H. L. Ong. On full abstraction for PCF. Submitted for publication, 1996."},{"key":"1_CR26","unstructured":"C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall International, 1985."},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"C. B. Jones. Process-algebraic foundations for an object-based design notation. Technical Report UMCS-93-10-1, University of Manchester, 1993.","DOI":"10.1007\/3-540-57208-2_12"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"C. B. Jones. Some practical problems and their influence on semantics. In Hanne Riis Nielson, editor, Programming Languages and Systems\u2014ESOP '96, volume 1058 of Lecture Notes in Computer Science, pages 1\u201317. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61055-3_26"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"A. Joyal, R. Street, and D. Verity. Traced monoidal categories. Technical report, 1995.","DOI":"10.1017\/S0305004100074338"},{"key":"1_CR30","doi-asserted-by":"crossref","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. Laplaza. Coherence for compact closed categories. Journal of Pure and Applied Algebra, 19:193\u2013213, 1980.","journal-title":"Journal of Pure and Applied Algebra"},{"key":"1_CR31","unstructured":"F. W. Lawvere. The category of probabilistic mappings. Unpublished manuscript, 1962."},{"key":"1_CR32","unstructured":"G. McCusker. Games and Full Abstraction for a functional metalanguage with recursive types. PhD thesis, Imperial College, University of London, 1996. to appear."},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"G. McCusker. Games and full abstraction for FPC. In International Symposium on Logic in Computer Science, 1996.","DOI":"10.1109\/LICS.1996.561316"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"R. Milner. Processes: a mathematical model of computing agents. In Logic Colloquium '73, pages 157\u2013173. North Holland, 1975.","DOI":"10.1016\/S0049-237X(08)71948-7"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"R. Milner. A Calculus of Communicating Systems. Springer-Verlag, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"1_CR36","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall International, 1989."},{"issue":"2","key":"1_CR37","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1017\/S0960129500001407","volume":"2","author":"R. Milner","year":"1992","unstructured":"R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2(2):119\u2013142, 1992.","journal-title":"Mathematical Structures in Computer Science"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"A. Mifsud, R. Milner, and J. Power. Control structures. In Tenth Annual Symposium on Logic in Computer Science, pages 188\u2013198, 1995.","DOI":"10.1109\/LICS.1995.523256"},{"issue":"1","key":"1_CR39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes. Information and Computation, 100(1):1\u201377, 1992.","journal-title":"Information and Computation"},{"issue":"3","key":"1_CR40","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","volume":"5","author":"G. Plotkin","year":"1976","unstructured":"G. Plotkin. A powerdomain construction. SIAM Journal on Computing, 5(3):452\u2013487, 1976.","journal-title":"SIAM Journal on Computing"},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"A. Pnueli and J. Sifakis, editors. Special issue on hybrid systems, 1995. Theoretical Computer Science vol. 138 no. 1.","DOI":"10.1016\/0304-3975(95)90065-9"},{"key":"1_CR42","doi-asserted-by":"crossref","unstructured":"U. Reddy. Global state considered unncessary: an object-based semantics for Algol. Lisp and Functional Programming, 1996.","DOI":"10.1007\/978-1-4757-3851-3_9"},{"key":"1_CR43","unstructured":"J. C. Reynolds. The essence of Algol. In J. W. de Bakker and J. C. van Vliet, editors, Algorithmic Languages, pages 345\u2013372. North Holland, 1981."},{"key":"1_CR44","unstructured":"K. St\u00d8len, F. Dederichs, and R. Weber. Assumption\/commitment rules for networks of asynchronously communicating agents. Formal Aspects of Computing, 1996."},{"key":"1_CR45","doi-asserted-by":"crossref","unstructured":"R. D. Tennent. Denotational semantics. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 3, pages 169\u2013322. Oxford University Press, 1994.","DOI":"10.1093\/oso\/9780198537625.003.0002"},{"key":"1_CR46","doi-asserted-by":"crossref","unstructured":"G. Winskel. Synchronization trees. In Automata, Languages and Programming: 10th International Colloquium, pages 695\u2013711. Springer-Verlag, 1983.","DOI":"10.1007\/BFb0036949"}],"container-title":["Lecture Notes in Computer Science","CONCUR '96: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61604-7_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T17:37:42Z","timestamp":1713634662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61604-7_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616047","9783540706250"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/3-540-61604-7_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}