Typing the Wild in Erlang
Developing a static type system suitable for Erlang has been of ongoing interest for almost two decades now. The challenge with retrofitting a static type system onto a dynamically typed language, such as Erlang, is the loss of flexibility in programming offered by the language. In light of this, many attempts to type Erlang trade sound type checking for the ability to retain flexibility. Hence, simple type errors which would be caught by the type checker of a statically typed language are easily missed in these developments. This has us wishing for a way to avoid such errors in Erlang programs.
In this paper, we develop a static type system for Erlang which strives to remain sound without being too restrictive. Our type system is based on Hindley-Milner type inference, which—unlike contemporary implementations of Hindley-Milner—is flexible enough to allow overloading of data constructors, branches of different types etc. Further, to allow Erlang’s dynamic type behaviour, we employ a program specialization technique called partial evaluation. Partial evaluation simplifies programs prior to type checking, and hence enables the type system to type such behaviour under certain restricted circumstances.
Sat 29 SepDisplayed time zone: Guadalajara, Mexico City, Monterrey change
15:30 - 16:10
Final talk and ClosingErlang at Burlington Route
|Typing the Wild in Erlang|
A: Nachiappan Valliappan Chalmers University of Technology, Sweden, A: John Hughes Chalmers University of Technology, SwedenDOI
|Farewell & Closing|
C: Adrian Francalanza University of Malta, C: Natalia Chechina Bournemouth University