Similar Items: Constraint solving in non-permutative nominal abstract syntax
- On Nominal Syntax and Permutation Fixed Points
- Extended Initiality for Typed Abstract Syntax
- Full abstraction for nominal general references
- Twin-width and permutations
- Automatic Modular Abstractions for Template Numerical Constraints
- Solving finite-domain linear constraints in presence of the $texttt{alldifferent}$