Similar Items: On Nominal Syntax and Permutation Fixed Points
- Constraint solving in non-permutative nominal abstract syntax
- Fixed point combinators as fixed points of higher-order fixed point generators
- Limit theorems for fixed point biased permutations avoiding a pattern of length three
- Proper Functors and Fixed Points for Finite Behaviour
- Fixed Points Theorems for Non-Transitive Relations
- Computational expressivity of (circular) proofs with fixed points