Reference:

Rene Neumann. Development of a concurrent language featuring a type system based on boolean implications. Master's thesis, Technische Universität München, 2011.

Abstract:

The well-known Hindley-Milner type system has several shortcomings. By presenting a new type system together with a type inference algorithm we try to address some of these shortcomings without losing the advantages of Hindley-Milner.

The type system uses constructor sets as types and therefore allows an easy approach to subtyping. Furthermore, by extending the basic function constructor, it allows functions to have multiple resulting types depending on the values of the arguments.

The type inference algorithm is split up in three phases: First automata construction to model the correct branching behavior. Then collecting the types of each expression and finally creating a set of implications between the different types. These implications allow to follow the flow of types through the program.

Additional to the type system, a process-based concurrent language to work with the type system is designed and presented in syntax and semantics.

Suggested BibTeX entry:

@mastersthesis{RNMaster,
    author = {Rene Neumann},
    school = {Technische Universit\"at M\"unchen},
    title = {Development of a concurrent language featuring a type system based on Boolean implications},
    year = {2011}
}