Main Menu
Home
Research activities
People
Publications
Collaborations
Seminars & Summer Schools
Job/Internship offers
Contact/Visit us
Login Form





Lost Password?
The Kell calculus
In this page you will find information about the current state of the Kell calculus, links to published papers and drafts, information about where the Kell calculus is going, and job opportunities. You will also find information about other formal methods used in the Sardes project, such as type systems for component-based systems.

Research on the Kell includes four main topics.

  • Calculus and Language: design of the calculus itself, its syntax and semantics, its extension into a programming language, and extensions such as sharing and multistage and transparent kells.
  • Formal Properties: creation of formal tools to guarantee some properties of Kell calculus terms, such as type systems and bisimulations. Use of these tools to study failures, transactions, and compensable actions in the calculus.
  • Fractal Modelisation: instantiation of the Kell calculus in FraKtal, a calculus able to faithfully model the Fractal component model.
  • Implementation: study of implementation strategies and realization of implementations of the Kell calculus.

 


 

Papers and presentations

 

Journal Papers
  • The Kell Calculus: A Family of Higher-Order Distributed Process Calculi. Alan Schmitt and Jean-Bernard Stefani. In LNCS volume of the post-proceedings of the Global Computing 2004 workshop, Venice, Italy, 2004. (34 pages)

    This paper presents the Kell calculus, a family of distributed process calculi, parameterized by languages for input patterns, that is intended as a basis for studying component-based distributed programming. The Kell calculus is built around a pi-calculus core, and follows five design principles which are essential for a foundational model of distributed and mobile programming: hierarchical localities, local actions, higher-order communication, programmable membranes, and dynamic binding. The paper discusses these principles, and defines the syntax and operational semantics common to all calculi in the Kell calculus family. The paper provides a co-inductive characterization of contextual equivalence for Kell calculi, under sufficient conditions on pattern languages, by means of a form of higher-order bisimulation called strong context bisimulation. The paper also contains several examples that illustrate the expressive power of Kell calculi.

 
Conference and Workshop Papers
 
Technical Reports
 
Presentations
 
Drafts


 

Implementation

 

An implementation of the Kell Calculus by Philippe Bidinger and David Teller is available on demand.
 

 

Job opportunities

 

If you are interested in an internship, a PhD, or a postdoc in the Kell calculus, please contact This e-mail address is being protected from spam bots, you need JavaScript enabled to view it