Auteur : Delia Kesner (Laboratoire PPS - Université Paris-Diderot)

Titre : Functional Programming with Dynamic Patterns

Abstract : 

The Pure Pattern Calculus (PPC) extends the lambda-calculus, as well
as the family of well-known algebraic pattern calculi, with
first-class patterns i.e. patterns can be passed as arguments,
evaluated and returned as results.  This new expressive power supports
two new forms of polymorphism. Path polymorphism allows recursive
functions to traverse arbitrary data structures. Pattern polymorphism
allows patterns to be treated as parameters which may be collected
from various sources or generated from training data.

The notion of matching failure of PPC not only provides a mechanism to
define functions by pattern matching on cases but also supplies PPC
with parallel-or-like, non-sequential behaviour. Therefore, devising
normalising strategies for PPC to obtain well-behaved implementations
turns out to be challenging.

In this talk we will introduce the Pure Pattern Calculus, its
syntax, semantics and main properties. We will show different
examples to illustrate the expressive power of the calculus. We will
then focus on normalising reduction strategies for PPC.