Séminaire CLAP - 21/10

Titre: Compiling pattern matching to in-place modifications

Résumé :
Algebraic data types and pattern matching are popular tools to build
programs manipulating complex datastructures in a safe yet efficient manner. On
top of its safety advantages, compilation techniques can turn pattern matching
into highly efficient deconstruction code for immutable use cases. Conversely,
high-performance datastructures and languages prefer to leverage (controlled)
mutations to maximize time and memory efficiency. Algebraic data types provide
a natural framework to efficiently describe in-place transformations as
rewrite rules. Such representation could take advantage of parallelism
opportunities that appear in tree-like structures. We present early steps
towards a new technique to compile pattern matching as parallel in-place
modifications of the underlying memory representation. Towards this goal, we
combine the usual language approach which is common in pattern-matching
compilation with tools from the polyhedral model, which is commonly used in
high-performance code generation to output efficient C code.

Titre: A Bigraph approach to the semantics of reactive programming languages

 

Reactive languages are often used to create safety critical software making it essential

to reason about and verify the behavior of these languages. We explore a method,

based on Milner’s Bigraphs, to model and express general properties about the semantics

of reactive programming languages such as propagation of change, unidirectionality, and

glitch avoidance. Bigraphs mirror non spatial (linking) and some-times the spatial (nesting)

aspects of reactive programming languages, provide rigorous analysis capabilities, and an

intuitive diagrammatic notation.