References

  1. R. Demangeon (2010): Terminaison des systèmes concurrents. ENS Lyon.
  2. R. Demangeon, D. Hirschkoff, N. Kobayashi & D. Sangiorgi (2007): On the Complexity of Termination Inference for Processes. In: Proc. of TGC'07, LNCS 4912. Springer, pp. 140–155, doi:10.1007/978-3-540-78663-4_11.
  3. R. Demangeon, D. Hirschkoff & D. Sangiorgi (2009): Mobile Processes and Termination. In: Semantics and Algebraic Specification, LNCS 5700. Springer, pp. 250–273, doi:10.1007/978-3-642-04164-8_13.
  4. R. Demangeon, D. Hirschkoff & D. Sangiorgi (2010): Termination in Impure Concurrent Languages. In: Proc. of CONCUR'10, LNCS 6269. Springer, pp. 328–342, doi:10.1007/978-3-642-15375-4_23.
  5. Y. Deng & D. Sangiorgi (2006): Ensuring termination by typability. Inf. Comput. 204(7), pp. 1045–1082, doi:10.1016/j.ic.2006.03.002.
  6. M. Hennessy & J. Rathke (2004): Typed behavioural equivalences for processes in the presence of subtyping. Math. Str. in Comp. Sc. 14(5), pp. 651–684, doi:10.1017/S0960129504004281.
  7. A. Igarashi & N. Kobayashi (2000): Type Reconstruction for Linear -Calculus with I/O Subtyping. Inf. Comput. 161(1), pp. 1–44, doi:10.1006/inco.2000.2872.
  8. N. Kobayashi & D. Sangiorgi (2010): A hybrid type system for lock-freedom of mobile processes. ACM Trans. Program. Lang. Syst. 32(5), doi:10.1145/1745312.1745313.
  9. Ericsson Computer Science Laboratory (2011): Erlang Programming Language Website. http://www.erlang.org.
  10. L. Mandel & L. Maranget (2010): The JoCaml programming language. http://jocaml.inria.fr/.
  11. B. C. Pierce & D. Sangiorgi (1996): Typing and Subtyping for Mobile Processes. Math. Structures in Comput. Sci. 6(5), pp. 409–453.
  12. D. Sangiorgi (2006): Termination of Processes. Math. Structures in Comput. Sci 16(1), pp. 1–39, doi:10.1017/S0960129505004810.
  13. D. Sangiorgi & D. Walker (2001): The π-calculus: a Theory of Mobile Processes. Cambridge Univ. Press.
  14. V. T. Vasconcelos & K. Honda (1993): Principal Typing Schemes in a Polyadic pi-Calculus. In: Proc. of CONCUR'93, Lecture Notes in Computer Science 715. Springer, pp. 524–538, doi:10.1007/3-540-57208-2_36.
  15. N. Yoshida, M. Berger & K. Honda (2004): Strong Normalisation in the Pi-Calculus.. Information and Computation 191(2), pp. 145–202, doi:10.1016/j.ic.2003.08.004.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org