No abstract

Session types are a well-established approach to ensuring protocol conformance and the absence of communication errors such as deadlocks in message passing systems. Haskell introduced implicit parameters, Scala popularised this feature and recently gave implicit types first-class status, yielding an expressive tool for handling context dependencies in a type-safe yet terse way. We ask: can type-safe implicit functions be generalised from Scala's sequential setting to message passing computation? We answer this question in the affirmative by presenting the first concurrent functional language with implicit message passing. The key idea is to generalise the concept of an implicit function to an implicit message, its concurrent analogue. Our language extends Gay and Vasconcelos's calculus of linear types for asynchronous sessions (LAST) with implicit functions and messages. We prove the resulting system sound by translation into LAST. † Extended abstract. We thank S. Gay, A. Scalas and V. Vasconcelos for valuable feedback on the present work. composed in parallel only when throughout the course of the computation each output of P 's is matched by a suitable input of Q's, and vice versa. Session types allow only dual processes to interact. Hence typability guarantees the absence of communication errors such as mismatched communication and deadlocks. A process Q, dual to P above, would have the session type