What Is a Good Process Semantics?

(Extended Abstract)
  • Robin Cockett
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4014)


Current mathematical tools for understanding processes predominantly support process modeling. In particular, they faithully represent all the things that can go wrong (deadlock, livelock, etc.). However, for the development of good programming abstractions in concurrent (and other) setting it is important to focus on formal systems in which things do not go wrong. So what are the formal models of processes where nothing goes wrong?


Category Theory Deductive System Linear Logic Proof Theory Mobile Process 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. In: Studies in Logic and the Foundations of Mathematics, Revised edn., vol. 103. North-Holland, Amsterdam (1984)Google Scholar
  2. 2.
    Bellin, G., Scott, P.J.: On the pi-calculus and linear logic. Theor. Comput. Sci. 135(1), 11–65 (1994)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Cockett, J.R.B., Pastro, C.: A language for multiplicative-additive linear logic. In: Proc. of 10th Conf. on Category Theory and Computer Science, CTCS 2004. Electron. Notes in Theor. Comput. Sci., vol. 122, pp. 23–65. Elsevier, Amsterdam (2005)Google Scholar
  4. 4.
    Lambek, J.: Deductive systems and categories II. In: Proc. of Conf. on Category Theory, Homology Theory and Their Applications. vol. 87 of Lect. Notes in Math., vol. 1, pp. 76–122. Springer, Heidelberg (1969)CrossRefGoogle Scholar
  5. 5.
    Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes I. Inform. and Comput. 100(1), 1–40 (1992)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes II. Inform. and Comput. 100(1), 41–77 (1992)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    van Glabbeek, R.J., Hughes, D.J.D.: Proof nets for unit-free multiplicative-additive linear logic. ACM Trans. on Comput. Logic 6(4), 784–842 (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Robin Cockett
    • 1
  1. 1.Dept. of Computer ScienceUniversity of CalgaryCalgaryCanada

Personalised recommendations