A Theory of Explicit Substitutions with Safe and Full Composition

Date
Authors
Kesner, Delia
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
Many different systems with explicit substitutions have been proposed to implement a large class of higher-order languages. Motivations and challenges that guided the development of such calculi in functional frameworks are surveyed in the first part of this paper. Then, very simple technology in named variable-style notation is used to establish a theory of explicit substitutions for the lambda-calculus which enjoys a whole set of useful properties such as full composition, simulation of one-step beta-reduction, preservation of beta-strong normalisation, strong normalisation of typed terms and confluence on metaterms. Normalisation of related calculi is also discussed.
Comment: 29 pages Special Issue: Selected Papers of the Conference "International Colloquium on Automata, Languages and Programming 2008" edited by Giuseppe Castagna and Igor Walukiewicz
Keywords
Computer Science - Programming Languages, Computer Science - Logic in Computer Science, F.3.2, D.1.1, F.4.1
Citation
Collections