Andrei Arusoaie
🇷🇴 Alexandru Ioan Cuza University, Romania
From Rewriting to Matching LogicChristiano Braga
🇧🇷 Universidade Federal Fluminense, Brasil
Compiler Construction in MaudePaola Bruscoli
🇬🇧 University of Bath, United Kingdom
An Introduction to Deep Inference Methodology in Proof TheoryXiaohong Chen
🇺🇸 University of Illinois at Urbana-Champaign, USA
From Rewriting to Matching LogicSantiago Escobar
🇪🇸 Universitat Politècnica de València, Spain
Unification and Narrowing in Maude 3.0Maribel Fernandez
🇬🇧 King’s College London, United Kingdom
Nominal RewritingCarsten Fuhs
🇬🇧 University of London, United Kingdom
Automated Complexity Analysis for Term RewritingRobert Glück
🇩🇰 University of Copenhagen, Denmark
Inversion and Term Rewriting SystemsMaja H. Kirkeby
🇩🇰 Roskilde University, Denmark
Inversion and Term Rewriting SystemsJean-Jacques Lévy
🇫🇷 Université Paris-Diderot - Paris 7 & École Polytechnique, France
Lambda Calculus: the Generalized Finite Development TheoremLuigi Liquori
🇫🇷 INRIA Sophia Antipolis - Méditerranée, France
Lambda calculi with patternsDorel Lucanu
🇷🇴 Alexandru Ioan Cuza University, Romania
From Rewriting to Matching LogicVincent van Oostrom
🇦🇹 University of Innsbruck, Austria
Lambda calculi with patternsJorge A. Pérez
🇳🇱 University of Groningen, The Netherlands
Session Types for Message-Passing ConcurrencyGrigore Rosu
🇺🇸 University of Illinois at Urbana-Champaign, USA
From Rewriting to Matching LogicCarolyn Talcott
🇺🇸 SRI International, USA
Pathway Logic: Using Rewriting Logic to Understand How Cells Work