Sciweavers

ENTCS
2010

Inference of Session Types From Control Flow

12 years 11 months ago
Inference of Session Types From Control Flow
This is a study of a technique for deriving the session type of a program written in a statically typed imperative language from its control flow. We impose on our unlabelled session type syntax a well-formedness constraint based upon normalisation and explore the effects thereof. We present our inference algorithm declaratively and in a form suitable for implementation, and illustrate it with examples. We then present an implementation of the algorithm using a program analysis and transformation toolkit.
Peter Collingbourne, Paul H. J. Kelly
Added 17 May 2011
Updated 17 May 2011
Type Journal
Year 2010
Where ENTCS
Authors Peter Collingbourne, Paul H. J. Kelly
Comments (0)