Session Type Inference in Haskell
Programming Languages
2011-10-20 v1
Abstract
We present an inference system for a version of the Pi-calculus in Haskell for the session type proposed by Honda et al. The session type is very useful in checking if the communications are well-behaved. The full session type implementation in Haskell was first presented by Pucella and Tov, which is 'semi-automatic' in that the manual operations for the type representation was necessary. We give an automatic type inference for the session type by using a more abstract representation for the session type based on the 'de Bruijn levels'. We show an example of the session type inference for a simple SMTP client.
Cite
@article{arxiv.1110.4163,
title = {Session Type Inference in Haskell},
author = {Keigo Imai and Shoji Yuen and Kiyoshi Agusa},
journal= {arXiv preprint arXiv:1110.4163},
year = {2011}
}
Comments
In Proceedings PLACES 2010, arXiv:1110.3853