English

Groups and Inverse Semigroups in Lambda Calculus

Logic in Computer Science 2026-04-27 v4

Abstract

We study invertibility of λ\lambda-terms modulo λ\lambda-theories. Here a fundamental role is played by a class of λ\lambda-terms called finite hereditary permutations (FHP) and by their infinite generalisations (HP). More precisely, FHPs are the invertible elements in the least extensional λ\lambda-theory λη\lambda \eta and HPs are those in the greatest sensible λ\lambda-theory HH^*. Our approach is based on inverse semigroups, algebraic structures that generalise groups and semilattices. We show that FHP modulo a λ\lambda-theory TT is always an inverse semigroup and that HP modulo TT is an inverse semigroup whenever TT contains the theory of B\"ohm trees. An inverse semigroup comes equipped with a natural order. We prove that the natural order corresponds to η\eta-expansion in FHP/T\mathrm{FHP} /T, and to infinite η\eta-expansion in HP/T\mathrm{HP}/T. Building on these correspondences we obtain the two main contributions of this work: firstly, we recast in a broader framework the results cited at the beginning; secondly, we prove that the FHPs are the invertible λ\lambda-terms in all the λ\lambda-theories lying between λη\lambda \eta and H+H^+. The latter is Morris' observational λ\lambda-theory, defined by using the β\beta-normal forms as observables.

Cite

@article{arxiv.2602.05654,
  title  = {Groups and Inverse Semigroups in Lambda Calculus},
  author = {Antonio Bucciarelli and Arturo De Faveri and Giulio Manzonetto and Antonino Salibra},
  journal= {arXiv preprint arXiv:2602.05654},
  year   = {2026}
}

Comments

Final version to appear in the Proceedings of FSCD 2026

R2 v1 2026-07-01T09:37:53.739Z