Typage fort et typage souple des collections topologiques et des transformations

TL;DR

This paper introduces two type systems for programming languages with topological collections and transformations, enabling static and mixed static/dynamic typing with automatic type inference.

Contribution

It presents a strong Hindley/Milner-like type system and a mixed static/dynamic type system for topological collections, allowing for flexible and fully inferred typing.

Findings

The strong type system is fully inferable at compile time.

The mixed type system handles heterogeneous collections.

Automatic type inference is achievable in both systems.

Abstract

Topological collections allow to consider uniformly many data structures in programming languages and are handled by functions defined by pattern matching called transformations. We present two type systems for languages with topological collections and transformations. The first one is a strong type system \`a la Hindley/Milner which can be entirely typed at compile time. The second one is a mixed static and dynamic type system allowing to handle heterogeneous collections, that is collections which contain values with different types. In the two cases, automatic type inference is possible.