Abstract: We design an extension of the join calculus with class-based inheritance. Method calls, locks, and states are handled in a uniform manner, using asynchronous messages. Classes are partial message definitions that can be combined and transformed by means of operators for behavioral and synchronization inheritance. We also give a polymorphic type system that statically enforces basic safety properties. Our language and its type system are compatible with the JoCaml implementation of the join calculus.

• Table of Contents
• Introduction
• The objective join calculus
  • Getting started
  • Syntax
  • Chemical semantics
• Inheritance and concurrency
  • Refining synchronization
  • Syntax
  • Rewriting semantics of the class language
  • Implementation issues
• Solving challenging examples
• Variations on the class language
  • Object initialization
  • Restriction of selective refinements
• Types and privacy
  • A semantics with privacy
  • Type expressions
  • Polymorphism and inheritance
  • Type checking processes and classes
  • Type checking solutions
  • Subject reduction with privacy
  • Example of typing
• Related and future works
• Conclusion
• References
• Cross-encodings to the join calculus
• Proofs for typing

This document was translated from L^AT_EX by H^EV^EA and H^AC^HA.