Year: 2021
Type: conference-paper
Abstract: 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.
Authors: Paul Iannetta, Laure Gonnord, Gabriel Radanne
Institutions: Lyon 1 Université, École Normale Supérieure de Lyon, Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, Laboratoire de l'Informatique du Parallélisme, CASH: Compilation et Analyse, Logiciel et Matériel, Institut polytechnique de Grenoble, Laboratoire de Conception et d'Intégration des Systèmes, Université Grenoble Alpes
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Funder: Agence Nationale de la Recherche
OpenAlex ID: W3216797193
