Skip to main content
SpringerLink
Log in

What Is a Good Process Semantics?

(Extended Abstract)

  • Conference paper
Mathematics of Program Construction (MPC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4014))

Included in the following conference series:

Abstract

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?

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  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. Bellin, G., Scott, P.J.: On the pi-calculus and linear logic. Theor. Comput. Sci. 135(1), 11–65 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  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. 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)

    Chapter  Google Scholar 

  5. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes I. Inform. and Comput. 100(1), 1–40 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  6. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes II. Inform. and Comput. 100(1), 41–77 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Calgary, 2500 University Drive NW, Calgary, Alb., T2N 1N4, Canada

    Robin Cockett

Authors
  1. Robin Cockett
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Cybernetics at Tallinn University of Technology, Akadeemia tee 21, EE-12618, Tallinn, Estonia

    Tarmo Uustalu

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cockett, R. (2006). What Is a Good Process Semantics?. In: Uustalu, T. (eds) Mathematics of Program Construction. MPC 2006. Lecture Notes in Computer Science, vol 4014. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11783596_1

Download citation

  • DOI: https://doi.org/10.1007/11783596_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35631-8

  • Online ISBN: 978-3-540-35632-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation