Programming Language Theory Concept
Structural induction modulo fresh renaming
Books
Journey Statusreviewing Tags
To show that holds for every , it is enough to show the following:
Formulation
Consider:
A set of sorts .
A set of variables .
A predicate that is parameterized by and .
A set of Abstract binding tree (ABT) with Free variables in .
To show that holds for every , it is enough to show the following:
If , then .
For every of arity , if for each , for every with , then .