A framework for studying substitution

Authors:
Härmel Nestra
Affiliations:
Institute of Computer Science, University of Tartu, J. Liivi 2, 50409 Tartu, Estonia
Venue:
Acta Cybernetica
Year:
2002

Citing 9
Cited 0

Substitution revisited

Theoretical Computer Science
Higher-order abstract syntax

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
A theory of binding structures and applications to rewriting

Theoretical Computer Science
Basic simple type theory

Basic simple type theory
Term rewriting and all that

Term rewriting and all that
An algebraic generalization of Frege structures—binding algebras

Theoretical Computer Science
Tree-Manipulating Systems and Church-Rosser Theorems

Journal of the ACM (JACM)
A New Approach to Abstract Syntax Involving Binders

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Abstract Syntax and Variable Binding

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a framework for handling bound variable renaming and substitution mathematically rigorously with the aim at the same time to stay as close as possible to human intuitive preconception about the phenomena, so that proofs could be deduced from intuitive motivations more directly than in the case of standard approaches.The theory is developed for general multi-sorted term algebras with variable binding. Therefore, the results hold for a wide class of term calculi such as the λ-calculus, first-order predicate logic, the abstract syntax of programming languages etc.