Charms of programming (requirements for a theory of . . .)

Abstract

The author identifies a unifying concept, called charm, for the substitution and binding mechanisms of logics, lambda-calculi, and programming languages. A survey of the algebraic properties of compositions of usual binding mechanisms shows that there is a common algebraic structure, from simple binding mechanisms like memories and environments to more complex ones like recursive systems or algebraic specifications. This common algebraic structure provides an outline for an unifying theory of charms of programming.<>