Session Type Inference in Haskell

Details Session Type Inference in Haskell Session Type Inference in Haskell

2011-10-19

arxiv.org/abs/1110.4163v1

EPTCS 69, 2011, pp. 74-91

Computer Science

Programming Languages

In Proceedings PLACES 2010, arXiv:1110.3853

Scientific paper

10.4204/EPTCS.69.6

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.

Affiliated with

Also associated with

No associations

Rating

Session Type Inference in Haskell does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Session Type Inference in Haskell, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Session Type Inference in Haskell will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-596707