Inference of Session Types From Control Flow | Zendy

Peter Collingbourne | Zendy; Paul H. J. Kelly | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Inference of Session Types From Control Flow

Author(s) -

Peter Collingbourne,

Paul H. J. Kelly

Publication year - 2010

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2010.06.003

Subject(s) - computer science , session (web analytics) , type inference , programming language , control flow , inference , program transformation , program analysis , model transformation , syntax , constraint (computer aided design) , theoretical computer science , transformation (genetics) , artificial intelligence , mathematics , biochemistry , chemistry , geometry , consistency (knowledge bases) , world wide web , gene

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research