Abstract
The substitution closure of a pattern class is the class of all permutations obtained by repeated substitution. The principal pattern classes (those defined by a single restriction) whose substitution closure can be defined by a finite number of restrictions are classified by listing them as a set of explicit families.