collaborators

6 papers

cs.LO2025

Nominal Equational Rewriting and Narrowing

Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes-Sobrinho +1

Narrowing is a well-known technique that adds to term rewriting mechanisms the required power to search for solutions to equational problems. Rewriting and narrowing are well-studi…

cs.LO2025

Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders

Maribel Fernández, Daniele Nantes-Sobrinho, Daniella Santaguida

Narrowing extends term rewriting with the ability to search for solutions to equational problems. While first-order rewriting and narrowing are well studied, significant challenges…

cs.LO2025

Equational Reasoning Modulo Commutativity in Languages with Binders (Extended Version)

Ali K. Caires-Santos, Maribel Fernández, Daniele Nantes-Sobrinho

Many formal languages include binders as well as operators that satisfy equational axioms, such as commutativity. Here we consider the nominal language, a general formal framework…

cs.LO2025

Generalization Problems with Atom-Variables in Languages with Binders and Equational Theories

Daniele Nantes-Sobrinho, Manfred Schmidt-Schauss, Alexander Baumgartner +1

Generalization problems in languages with binders involve computing the most common structure between expressions while respecting bound variable renaming and freshness constraints…

cs.LO2024

Typed Non-determinism in Concurrent Calculi: The Eager Way

Bas van den Heuvel, Daniele Nantes-Sobrinho, Joseph W. N. Paulus +1

We consider the problem of designing typed concurrent calculi with non-deterministic choice in which types leverage linearity for controlling resources, thereby ensuring strong cor…

cs.LO2024

Strong Nominal Semantics for Fixed-Point Constraints

Ali K. Caires-Santos, Maribel Fernández, Daniele Nantes-Sobrinho

Nominal algebra includes -equality and freshness constraints on nominal terms endowed with a nominal set semantics that facilitates reasoning about languages with binders. Nomi…