Séminaire Cambium, Inria Paris
                               Salle Anita Borg
                           Mardi 28 octobre, 10h30

                              Arthur Charguéraud
                               Inria Strasbourg

          Binding Boolean Expressions and Extended Pattern Matching

Pattern matching has been around for decades, and subject to extensive
research and extensions over the years. Nevertheless, recent features
such as Rust's if-let construct, and recent articles such as Cheng and
Parreaux's (OOPSLA'24), suggest that there might still be room for
improvement. In this talk, I will describe a streamlined presentation
that unifies the various constructs related to pattern matching and to
extended forms of conditionals. For the proposed constructs, I will
present syntax, semantics, typing rules, as well as a naive
compilation scheme. Interestingly, all the ingredients take the form
of conservative extensions of the traditional ML formalism. Regarding
program optimization, I will present a few representative rewrite
rules, and explain how OptiTrust's type-and-effect system can be used
to check for commutativity or idempotence of effects, two properties
that are crucial for optimizing patterns that feature possibly
effectful expressions.

            Vous pouvez vous abonner à nos annonces de séminaires:
                     http://cambium.inria.fr/seminar.html

             Nos séminaires sont accessibles en ligne en direct
                            via le lien ci-dessus.