Elementary structures in process theory (1): Sets with renaming

Mathematical Structures in Computer Science

Volumn 10, Issue 5, 2000, Pages 617-663

  Honda, Kohei ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84978976402     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129599002947     Document Type: Article

References (66)

1. Abramsky, S. (1996) Retracing Some Paths in Process Algebras. CONCUR’96. Springer-Verlag Lecture Notes in Computer Science 1119 1–17.
2. Abramsky, S., Gay, S. and Nagarajan, R. (1995) Interaction Categories and Foundations of Typed Concurrent Computing. Deductive Program Design: Proceedings of the 1994 Marktoberdorf Inter-national Summer School, Springer-Verlag.
3. Abramsky, S., Jagadeesan, R. and Malacaria, P. (1994) Full Abstraction for PCF. To appear in Infomation and Computation.
4. Asperti, A., Danos, V., Laneve, V. and Regnier, L. (1994) Paths in the lambda-calculus. In: LICS’94, IEEE Computer Society Press, 426–436.
5. Asperti, A. and Longo, L. (1991) Categories, Types and Categories, Types and Structures: an intro-duction to Category Theory for the working computer scientist, M.I.T. Press.
6. Aczel, P. (1990) Replacement Systems and the axiomatisation of Situation Theory. In: Situation Theory and Applications. CSLI Lecture Notes 22 Stanford University.
7. Aczel, P. (1991) Term Declaration Logic and Generalised Composita. In: LICS ’91, IEEE Computer Society Press.
8. Bawden, A. (1986) Connection Graphs, Lisp and Function, ACM Press 258–265.
9. Baeton, J. and Wejland, W. (1990) Process Algebra, Cambridge Tracts in Theoretical Computer Science, CUP.
10. Berry, G. and Boudol, G. (1990) The Chemical Abstract Machine. Theoretical Computer Science 96 217–248.
11. Boreale, M. and Sangiorgi, D. (1996) Some Congruence Properties for π-calculus Bisimilarities, Revised version of Tec. Rep. RR-2870, INRIA - Sophia Antipolis. Danos, V. and Regnier, L. (1993) Local and asynchronous beta-reduction (an analysis of Girard’s execution formula). In: LICS’93, IEEE Computer Society Press.
12. Danos, V. and Regnier, L. (1996) Reversible and Irreversible Computations. ENCS 3 Elsevier.
13. Freyd, P. and Scedrov, A. (1990) Categories, Allegories, North-Holland.
14. Gardner, P. (1995) A name free account of action calculi. In: Proc. MFPS’95. ENCS 1, Elsevier.
15. Girard, J.-Y. (1987) Linear Logic, Theoretical Computer Science 50 1–102.
16. Girard, J.-Y. (1988) Geometry of Interaction I: interpretation of System F. In: Logic Colloquium ’88, North-Holland.
17. Girard, J.-Y. (1989) Geometry of Interaction II: deadlock free algorithms. In: Proceedings of COLOG-88. Springer-Verlag Lecture Notes in Computer Science 417.
18. Girard, J.-Y. (1995b) Geometry of Interaction III: Accomodating the Additives. In: Girard, J.-Y., Lafont, Y. and Regnier, L. (eds.) Advances in linear logic. London Mathematical Society Lecture Notes Series, Cambridge University Press 222 329–389.
19. Girard, J.-Y. (1996) Proof Nets: Parallel Syntax for Proof-Theory. Typescript, 28pp.
20. Girard, J.-Y., Lafont, Y. and Regnier, L. (eds.) (1995) Advances in linear logic. London Mathematical Society Lecture Notes Series, Cambridge University Press 222.
21. Gonthier, G., Abadi, M. and Levy, J.-J. (1992) The Geometry of Optimal Lambda Reduction. In: POPL’92, ACM press 15–26.
22. Hennesy, M. (1989) Algebraic Theory of Processes, MIT Press.
23. Hoare, C. A. R. (1985) Communicating Sequential Processes, Prentice Hall.
24. Honda, K. (1995a) Notes on P-Algebra (1): Process Structure. Proc. TPPP’94. Springer-Verlag Lecture Notes in Computer Science 907. Also as UMCS-95-12-2, Department of Computer Science, University of Manchester.
25. Honda, K. (1995b) Notes on P-Algebra (2): Group Presentation of Process Structure. UMCS-95-12-3, Department of Computer Science, University of Manchester.
26. Honda, K. (1996) Composing Processes. POPL’96, ACM Press 344–357.
27. Honda, K. and Yoshida, N. (1993) On Reduction-Based Process Semantics. Theoretical Computer Science 151 437–486.
28. Honda, K. and Yoshida, N. (1994a) Combinatory Representation of Mobile Processes. In: POPL’94, ACM press 348–360.
29. Honda, K. and Yoshida, N. (1994b) Replication in Concurrent Combinators, In: TACS’94. Springer-Verlag Lecture Notes in Computer Science 789 786–805.
30. Honda, K. and Yoshida, N. (1997) Game-theoretic Analysis of Call-by-value Computation. In: Proc. of ICALP’97. Springer-Verlag Lecture Notes in Computer Science 1256 225–236. (Full version to appear in Theoretical Computer Science.)
31. Hyland, M. and Ong, L. (1994) On Full Abstraction for PCF”: I, II and III. 130 pages, ftp-able at theory. doc. ic. ac. uk/papers/0ng. (To appear in Information and Computation.) Jech (1977) About the axiom of choice. In: Handbook of Mathematical Logic, North-Holland 345–370.
32. Kunen, K. (1980) Set Theory: An Introduction to Independence Proofs, North-Holland.
33. Kahn, G. and MacQueen, D. (1977) Coroutines and networks of parallel processes. Information Processing 11 993–998.
34. Lafont, Y. (1990) Interaction Nets. In: POPL’90, ACM press 95–108.
35. Lafont, Y. (1995) From Interaction Nets to Proof Nets. In: Girard, J.-Y., Lafont, Y. and Regnier, L. (eds.) Advances in linear logic. London Mathematical Society Lecture Notes Series, Cambridge University Press 222 225–248.
36. Lafont, Y. (1996) Interaction Combinators. Infomation and Computation 137 69–101. Lambek, J. and Scott, P. J (1986) Introduction to higher order categorical logic, Cambridge University Press.
37. Lamping, J. (1990) An Algorithm for Optimal Lambda Calculus Reduction. In: POPL’90, ACM Press 16–30.
38. Lang, S. (1993) Algebra, third edition, Addison Wesley.
39. Mac Lane, S. and Moerdijk, I. (1992) Sheaves in Geometry and Logic, Springer-Verlag.
40. McLarty, C. (1992) Elementary Categories, Elementary Toposes, Oxford University Press.
41. Meseguer, J. (1992) Conditional Rewriting Logic as a Unified Model of Concurrency. Theoretical Computer Science 92.
42. Mifsud, A. (1996) Control Structures, Ph. D. Thesis, Uniyersity of Edinburgh.
43. Mifsud, A., Milner, R. and Power, J. (1996) Control Structures. In: LICS 95, IEEE Computer Society.
44. Milner, R. (1979) Flowgraphs and Flow Algebras. Journal of Computing Machinery 794–818.
45. Milner, R. (1980) A Calculus of Communicating Systems. Springer-Verlag Lecture Notes in Computer Science 76.
46. Milner, R. (1989) Communication and Concurrency, Prentice Hall.
47. Milner, R. (1990) Functions as Processes. Mathematical Structures in Computer Science 2 (2) 119–146.
48. Milner, R. (1992) Polyadic null a tutorial. Logic and Algebra of Specification 203–246.
49. Milner, R. (1993) Action Structures. Research Report LFCS-92-249, Computer Science Department, Edinburgh University.
50. Milner, R. (1994) Pi-nets: a graphical form of pi-calculus. In: Proc. of ESOP’94, Programming. Springer-Verlag Lecture Notes in Computer Science 788 26–42.
51. Milner, R. (1995a) Calculi for Interaction. Acta Informatica 33 (8) 707–737.
52. Milner, R. (1995b) Control Structures II: Naming Monoids (draft).
53. Milner, R., Parrow, J. G. and Walker, D.J. (1989) A Calculus of Mobile Processes. Information and Computation 100 (1) 1–77.
54. Milner, R. and Sangiorgi, D. (1992) Barbed Bisimulation. In: Proc. of ICALP’92. Springer-Verlag Lecture Notes in Computer Science 623 685–695.
55. Nerode, A. (1959) Composita, Equations, and Freely Generated Algebras. Transactions of the American Mathematical Society 139–151.
56. Palamidessi, C. (1997) Comparing the Expressive Power of the Synchronous and the Asynchronous π-calculus In: POPL’97, ACM press 256–265.
57. Parrow, Y. (1993) Interaction Diagrams. In: Decades of Concurrency. Springer-Verlag Lecture Notes in Computer Science 803 477–508.
58. Pierce, B. C. and Sangiorgi. D. (1993) Typing and subtyping for mobile processes. LICSV3 187–215. (The full version appeared in Mathematical Structures in Computer Science (1996) 6 (5) 409-454.)
59. Pitts, A. and Gabbay, D. (1999) A New Approach to Abstract Syntax Involving Binding. LICS’99, IEEE.
60. Raja, N. and Shyamasundar, R. K. (1994) Combinatory Formulations of Concurrent Languages. TOP LAS, ACM Press 19 (6) 899–915.
61. Sangiorgi, D. (1992) Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms, Ph. D. Thesis, Department of Computer Science, University of Edinburgh.
62. Stark, I. (1995) Names and Higher-Order Functions, Ph. D. Thesis, Department of Computer Science, Cambridge University.
63. Walker, D. (1994) Objects in the π-calculus Information and Computation 116 (2) 253–271.
64. Winskel, G. (1984) Synchronization Trees. Theoretical Computer Science 34 33–82.
65. Winskel, G. and Nielsen, M. (1995) Models for Concurrency. In: Handbook of Logic in Computer Science 4 Oxford University Press 1–148. Yoshida, N. (1994) Graph Notation for Concurrent Combinators. In: TPPP’94. Springer-Verlag Lecture Notes in Computer Science 907 393–412.
66. Yoshida, N. (1998) Minimality and Separation Results on Asynchronous Mobile Processes: Repre-sentability Theorems by Concurrent Combinators. Proc. CONCUR’98. Springer-Verlag Lecture Notes in Computer Science 1466 131–146.