Explicit substitutions and all that

Abstract

Explicit substitution calculi are extensions of the λ-calculus where the substitution mechanism is internalized into the theory. This feature makes them suitable for implementation and theoretical study of logic based tools as strongly typed programming languages and proof assistant systems. In this paper we explore new developments on two of the most successful styles of explicit substitution calculi: theλσ and λse-calculi.