Strong normalisation in the π-calculus

Information and Computation

Volumn 191, Issue 2, 2004, Pages 145-202

  Yoshida, Nobuko ^a   Berger, Martin ^b   Honda, Kohei ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Concurrency theory; Strong normalisation; The calculus; Type theory

Indexed keywords

ALGEBRA; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; LOGIC PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; SYSTEMS ENGINEERING;

CONCURRENCY THEORY; STRONG NORMALIZATION; TYPE THEORY;

CONCURRENT ENGINEERING;

EID: 2942538012     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2003.08.004     Document Type: Article

References (78)

1. S. Abramsky, Computational interpretation of linear logic, TCS 111 (1993) 3-57.
2. S. Abramsky, Proofs as processes, TCS 135 (1994) 5-9.
3. S. Abramsky, R. Jagadeesan, Games and full completeness for multiplicative linear logic, JSL 59 (1994).
4. S. Abramsky, R. Jagadeesan, P. Malacaria, Full abstraction for PCF, Inform. Comput. 163 (2000) 409-470.
5. S. Abramsky, Process Readability, A Tutorial Workshop on Realizability Semantics and Applications, 1999. Available from 〈web.comlab.ox.ac.uk/oucl/ work/samson.abramsky〉.
6. T. Altenkirch, P. Dybjer, M. Hofmann, P. Scott, Normalisation by evaluation for typed lambda calculus with coproducts, in: Proceedings of the LICS'01, IEEE, London, 2001, pp. 303-310.
7. H. Barendregt, The Lambda Calculus: Its Syntax and Semantics, North-Holland, Amsterdam, 1984.
8. H. Barendregt, Lambda calculi with types, in: Handbook of Logic in Computer Science, vol. 2, Clarendon Press, Oxford, 1992, pp. 118-120.
9. G. Bellin, P.J. Scott, On the pi-calculus and linear logic, TCS 135 (1994) 11-65.
10. M. Berger, K. Honda, N. Yoshida, Sequentiality and the π-calculus, in: Proceedings of the TLCA01, LNCS, vol. 2044, Springer, Berlin, 2001, pp. 29-45.
11. The full version of [10]. Available from 〈www.dcs.qmw.ac.uk/ ~kohei〉.
12. M. Berger, K. Honda, N. Yoshida, Genericity and the π-calculus, in: Proceedings of the FoSSaCs03, LNCS, vol. 2620, Springer, Berlin, 2003, pp. 103-119.
13. M. Boreale, On expressiveness in internal mobility of name passing calculi, TCS 195 (1998) 206-226.
14. M. Boreale, D. Sangiorgi, Some congruence properties for π-calculus bisimilarities, TCS 198 (1998) 159-176.
15. G. Boudol, Asynchrony and the pi-calculus, INRIA Research Report 1702, 1992.
16. G. Boudol, The pi-calculus in direct style, in: Proceedings of the POPL'97, ACM, New York, 1997, pp. 228-241.
17. G. Boudol, I. Castellani, Noninterference for concurrent programs, in: Proceedings of the ICALP01, LNCS, vol. 2076, Springer, Berlin, 2001, pp. 382-395.
18. S. Chaki, S. Rajamani, J. Rehof, Types as models: model checking message-passing programs, in: Proceedings of the POPL'02, ACM, New York, 2002.
19. N. Ghani, Adjoint rewriting, Ph.D. Thesis, LFCS, University of Edinburgh, November 1995.
20. N. Ghani, βη-Equality from coproducts, in: Proceedings of the TLCA'95, LNCS, vol. 902, Springer, Berlin, 1995, pp. 171-185.
21. J.H. Gallier, On Girard's "Candidats de Reductibilité," Logic and Computer Science, Academic Press, New York, 1990, pp. 123-203.
22. S. Gay, M. Hole, Types and subtypes for client-server interactions, in: Proceedings of the ESOP'99, LNCS, vol. 1576, Springer, Berlin, 1999, pp. 74-90.
23. J.-Y. Girard, Linear logic, TCS 50 (1987) 1-102.
24. J.-Y. Girard, Y. Lafont, P. Taylor, Proofs and types, vol. 7 of Cambridge Tracts in Theoretical Computer Science, CUP, 1989.
25. C.A. Gunter, Semantics of Programming Languages: Structures and Techniques, MIT Press, Cambridge, MA, 1992.
26. M. Hicks, P. Kakkar, J.T. Moore, C.A. Gunter, S. Nettles, PLAN: a packet language for active networks, in: Proceedings of the International Conference on Functional Programming (ICFP'98), cf. [58].
27. K. Honda, Types for dyadic interaction, in: Proceedings of the CONCUR'93, LNCS, vol. 715, 1993, pp. 509-523.
28. K. Honda, Composing processes, in: Proceedings of the POPL'96, ACM, New York, 1996, pp. 344-357.
29. K. Honda, M. Kubo, V. Vasconcelos, Language primitives and type discipline for structured communication-based programming, in: Proceedings of the ESOP'98, LNCS, vol. 1381, Springer, Berlin, 1998, pp. 122-138.
30. K. Honda, M. Tokoro, An object calculus for asynchronous communication, in: Proceedings of the ECOOP'91, LNCS, vol. 512, Springer, Berlin, 1991, pp. 133-147.
31. K. Honda, V. Vasconcelos, N. Yoshida, Secure information flow as typed process behaviour, in: Proceedings of the ESOP'99, LNCS, vol. 1782, pp. 180-199, Springer, Berlin, 2000. Full version available as MCS Technical Report 01/2000, University of Leicester, 2000.
32. K. Honda, V. Vasconcelos, N. Yoshida, Secure information flow as typed process behaviour, in: Proceedings of the ESOP'99, LNCS, vol. 1782, pp. 180-199, Springer, Berlin, 2000. Full version available as MCS Technical Report 01/2000, University of Leicester, 2000.
33. K. Honda, N. Yoshida, On reduction-based process semantics, in: TCS, 151, North-Holland, Amsterdam, 1995, pp. 437-486.
34. K. Honda, N. Yoshida, Game-theoretic analysis of call-by-value computation, in: TCS, 221, North-Holland, Amsterdam, 1999, pp. 393-456.
35. K. Honda, N. Yoshida, A uniform type structure for secure information flow, in: Proceedings of the POPL'02, ACM, New York, 2002, pp. 81-92, Full version as a DOC Technical Report, Department of Computing, Imperial College London, 2002/13, August, 2002. Revised in August, 2003. Available from 〈www.doc.ic.ac.uk/~yoshida〉.
36. K. Honda, N. Yoshida, A uniform type structure for secure information flow, in: Proceedings of the POPL'02, ACM, New York, 2002, pp. 81-92, Full version as a DOC Technical Report, Department of Computing, Imperial College London, 2002/13, August, 2002. Revised in August, 2003. Available from 〈www.doc.ic.ac.uk/~yoshida〉.
37. K. Honda, N. Yoshida, Noninterference through Flow Analysis, a DOC Technical Report 2002/14, Imperial College London, revised September 2003, 40 pp. Available from 〈www.doc.ic.ac.uk/~yoshdia〉.
38. K. Honda, N. Yoshida, M. Berger, Control in the π-calculus, in: Proceedings of the CW'04, ACM, New York, 2004.
39. G. Huet, Confluent reductions: Abstract properties and applications to term rewriting systems, J. Assoc. Comput. 23 (1) (1981) 11-21.
40. M. Hyland, L. Ong, On full abstraction for PCF: I, II and III, Inform. Comput. 163 (2000) 285-408.
41. A. Igarashi, N. Kobayashi, A generic type system for the pi-calculus, in: Proceedings of the POPL'01, ACM, New York, 2001.
42. J.W. Klop, Term rewriting systems, in: Handbook of Logic in Computer Science, vol. 2, Clarendon Press, Oxford, 1992, pp. 2-117.
43. N. Kobayashi, A partially deadlock-free typed process calculus, ACM TOPLAS 20 (2) (1998) 436-482.
44. N. Kobayashi, Type systems for concurrent processes: from deadlock-freedom to livelock-freedom, time-boundedness, in: Proceedings of the TCS2000, LNCS, vol. 1872, Springer, Berlin, 2000, pp. 365-389.
45. N. Kobayashi, B. Pierce, D. Turner, Linear types and π-calculus, in: Proceedings of the POPL'96, ACM, New York, 1996, pp. 358-371.
46. J. Laird, A deconstruction of non-deterministic classical cut elimination, in: Proceedings of the TLCA'01, LNCS, vol. 2044, Springer, Berlin, 2001, pp. 268-282.
47. O. Laurent, Polarized games, in: Proceedings of the LICS 2002, IEEE, London, 2002, pp. 265-274.
48. O. Laurent, Invited lecture: polarities in linear logic, Linear Logic Workshop, 2002.
49. Y. Lafont, Interaction nets, in: Proceedings of the POPL'90, ACM, New York, 1990, pp. 95-108.
50. J.-J. Lévy, An algebraic interpretation of the λ-β-K-calculus and a labelled λ-calculus, in: Proceedings of the λ-calculus and Computer Science Theory, LNCS, vol. 37, Springer, Berlin, 1975, pp. 147-165.
51. M. Merro, D. Sangiorgi, On asynchrony in name-passing calculi, in: Proceedings of the ICALP'98, LNCS, vol. 1443, Springer, Berlin, 1998, pp. 856-867.
52. R. Milner, A Calculus of Communicating Systems, LNCS, vol. 76, Springer, Berlin, 1980.
53. R. Milner, Functions as Processes, MSCS, vol. 2(2), CUP, 1992, pp. 119-146.
54. R. Milner, Polyadic π-calculus: a tutorial, in: Proceedings of the International Summer School on Logic Algebra of Specification, Marktoberdorf, 1992.
55. R. Milner, J.G. Parrow, D.J. Walker, A calculus of mobile processes, Inform. Comput. 100 (1) (1992) 1-77.
56. J. Mitchell, Foundations for Programming Languages, MIT Press, Cambridge, MA, 1996.
57. L. Ong, C. Stewart, A Curry-Howard foundation for functional computation with control, in: Proceedings of the POPL'97, ACM, New York, 1997.
58. M. Parigot, λμ-Calculus: an algorithmic interpretation of classical natural deduction, in: Proceedings of the Logic Programming and Automated Reasoning, LNCS, vol. 624, Springer, Berlin, 1992, pp. 190-201.
59. B.C. Pierce, D. Sangiorgi, Typing and subtyping for mobile processes, in: Proceedings of the LICS'93, IEEE, London, 1993, pp. 187-215.
60. PLAN: A Packet Language for Active Networks, Switch Ware Project, University of Pennsylvania. Available from 〈http://www.cis.upenn.edu/ ~switchware/〉.
61. P. Quaglia, D. Walker, On synchronous and asynchronous mobile processes, in: Proceedings of the FoSSaCS 00, LNCS, vol. 1784, Springer, Berlin, 2000, pp. 283-296.
62. D. Sangiorgi, π-Calculus, internal mobility, and agent-passing calculi, TCS 167(2) (1996) 235-271, North-Holland, Amsterdam.
63. D. Sangiorgi, The name discipline of uniform receptiveness, in: Proceedings of the ICALP'97, LNCS, vol. 1256, Springer, Berlin, 1997, pp. 303-313.
64. D. Sangiorgi, Types, or: where's the difference between CCS and π?, in: Proceedings of the CONCUR 2002, LNCS, vol. 2421, Springer, Berlin, 2002, pp. 76-97.
65. G. Smith, A new type system for secure information flow, in: Proceedings of the CSFW'01, IEEE, London, 2001.
66. G. Smith, D. Volpano, Secure information flow in a multi-threaded imperative language, in: Proceedings of the POPL'98, ACM, New York, 1998, pp. 355-364.
67. W. Tait, Intensional interpretation of functionals of finite type, I., J. Symb. Log 32 (1967) 198-212.
68. C. Urban, G.M. Bierman, Strong normalisation of cut-elimination in classical logic, Fundam. Inform. 45 (1-2) (2001) 123-155.
69. V. Vasconcelos, Typed concurrent objects, in: Proceedings of the ECOOP'94, LNCS, vol. 821, Springer, Berlin, 1994, pp. 100-117.
70. V. Vasconcelos, K. Honda, Principal typing scheme for polyadic π-calculus, in: Proceedings of the CONCUR'93, LNCS, vol. 715, Springer, Berlin, 1993, pp. 524-538.
71. N. Yoshida, Graph types for monadic mobile processes, in: Proceedings of the FST/TCS'16, LNCS vol. 1180, Springer, Berlin, 1996. Full version as LFCS Technical Report, ECS-LFCS-96-350, 1996, pp. 371-387.
72. N. Yoshida, Graph types for monadic mobile processes, in: Proceedings of the FST/TCS'16, LNCS vol. 1180, Springer, Berlin, 1996. Full version as LFCS Technical Report, ECS-LFCS-96-350, 1996, pp. 371-387.
73. N. Yoshida, Type-based liveness guarantee in the presence of nontermination and nondeterminism, April 2002. MCS Technical Report, 2002-20, University of Leicester. Available from 〈www.doc.ic.ac.uk/~yoshida〉.
74. N. Yoshida, M. Berger, K. Honda, Strong Normalisation in the π-calculus, in: Proceedings of the LICS'01, IEEE, London, 2001, pp. 311-322. The first full version as MCS Technical Report, 2001-09, University of Leicester, 2001.
75. N. Yoshida, M. Berger, K. Honda, Strong Normalisation in the π-calculus, in: Proceedings of the LICS'01, IEEE, London, 2001, pp. 311-322. The first full version as MCS Technical Report, 2001-09, University of Leicester, 2001.
76. N. Yoshida, K. Honda, M. Berger, Linearity and bisimulation, in: Proceedings of the Fifth International Conference, Foundations of Software Science and Computer Structures (FoSSaCs 2002), LNCS 2303, pp. 417-433, Springer, Berlin, 2002. A full version as a MCS Technical Report, 2001-48, University of Leicester, 2001. Available from 〈www.doc.ic.ac.uk/ ~yoshida〉.
77. N. Yoshida, K. Honda, M. Berger, Linearity and bisimulation, in: Proceedings of the Fifth International Conference, Foundations of Software Science and Computer Structures (FoSSaCs 2002), LNCS 2303, pp. 417-433, Springer, Berlin, 2002. A full version as a MCS Technical Report, 2001-48, University of Leicester, 2001. Available from 〈www.doc.ic.ac.uk/ ~yoshida〉.
78. N. Yoshida, Channel dependency types for higher-order mobile processes, in: Proceedings of the POPL'04, ACM, New York, 2004.