A framework for studying substitution

Nestra, Härmel: A framework for studying substitution. Acta cybernetica, (15) 4. pp. 633-652. (2002)

[img] Cikk, tanulmány, mű
cybernetica_015_numb_004_633-652.pdf

Download (1MB)

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.

Item Type: Article
Event Title: Finno-Ugoric Symposium on Programming Languages and Software Tools, 7., 2001, Szeged
Journal or Publication Title: Acta cybernetica
Date: 2002
Volume: 15
Number: 4
Page Range: pp. 633-652
ISSN: 0324-721X
Language: angol
Uncontrolled Keywords: Természettudomány, Informatika
Additional Information: Bibliogr.: 652. p.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2018. Jun. 05. 15:08
URI: http://acta.bibl.u-szeged.hu/id/eprint/12700

Actions (login required)

View Item View Item