Skip to content
scrambled
Programming Language Theory Concept

Fresh renaming

Given a set of variables mathcalX and a finite sequence of variables vecx, a bijection rho:vecxleftrightarrowvecx′ between vecx and vecx′, where vecx′ is fresh f

Given a set of variables 𝒳 and a finite sequence of variables x→, a bijection ρ:x→↔x→′ between x→ and x→′, where x→′ is fresh for 𝒳.