The Undecidability of Unification Modulo σ Alone

05/09/2023

∙

by   Gilles Dowek, et al.

∙

0

∙

share

The rewriting system sigma is the set of rules propagating explicit substitutions in the lambda-calculus with explicit substitutions. In this note, we prove the undecidability of unification modulo sigma.