An abstract framework for environment machines
This paper developes a calculus of classes, i.e. a formalism to handle \(\lambda\)-terms with substitutions. It is shown that machines with environment (Krivine's machine and the CAM) essentially corresponds to different strategies for normalizing closures (call by name, call by value). Simple typed closures are also considered and a categorical point of view is sketched.
scientific article; zbMATH DE number 4201608
scientific article