Typing rule-based transformations over topological collections

Julien Cohen (1)

1 LaMI - Laboratoire de Méthodes Informatiques

Pattern-matching programming is an example of a rule-based programming style developed in functional languages. This programming style is intensively used in dialects of ML but is restricted to algebraic data-types. This restriction limits the field of application. However, as shown by Giavitto and Michel at RULE'02, case-based function definitions can be extended to more general data structures called topological collections. We show in this paper that this extension retains the benefits of the typed discipline of the functional languages. More precisely, we show that topological collections and the rule-based definition of functions associated with them fit in a polytypic extension of mini-ML where type inference is still possible.

Mots clés: rule-base programming; type system; topological collections

Domaines: Langage de programmation [cs.PL]

Julien Cohen. Typing rule-based transformations over topological collections. 4th International Workshop on Rule-Based Programming, Jun 2003, Valencia, Spain. pp.61-76, ⟨10.1016/S1571-0661(04)80676-5⟩. ⟨hal-00442371⟩