Copenhagen Programming Language
Instant Polymorphic Type Systems for Mobile Process Calculi: Just Add Reduction Rules and Stir
Heriot-Watt University, Edinburgh, Scotland
Thursday, September 23th, 15:15-16:15
ITU, Rued Langgaards Vej 7, 0A.35
Many different mobile process calculi have been invented, and for each some number of type systems has been developed. Soundness and other properties must be proved separately for each calculus and type system.
We present ongoing work on developing a generic polymorphic type system Poly* which works for a wide range of mobile process calculi. For any calculus satisfying some general syntactic conditions, well-formedness rules for types are derived automatically from the reduction rules and Poly* works otherwise unchanged. The derived type system is automatically sound and often more precise than previous type systems for the calculus, due
to Poly*'s spatial polymorphism.
(joint work with J. B. Wells)
Kasper Østerbye. Administrative host:
Camilla Jensen. All are welcome.
The Copenhagen Programming
Language Seminar (COPLAS) is a collaboration between DIKU,
ITU and KVL.
To receive information about COPLAS talks by email, send a message to
email@example.com with the word 'subscribe' as subject or in the body.
For more information about COPLAS, see