Calculs avec Motifs Dynamiques
Thibaut Balabonski · HAL (Le Centre pour la Communication Scientifique Directe) · 2008
Pattern matching mechanisms of usual functional programming languages can be enriched by two new kinds of polymorphisms (called path polymorphism and pattern polymorphism) as it is done in the Pure Pattern Calculus (PPC) of B. Jay and D. Kesner. This report contributes to the implementation of this framework by a study of some reduction strategies. Lazy evaluation in particular requires some insight in the patching mechanism itself, and motivates the construction of the Explicit Pattern Calculus (EPC) : a variant of PPC with an explicit pattern matching mechanism. The confluence of EPC as well as simulation theorems linking PPC and EPC are proven.