Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Fundamental theorems of extensional untyped lambda-calculus revisited
Authors: Alexandre Lyaletsky
– 0.12 Mb
Abstract
This paper presents new proofs of three following fundamental theorems of the untyped extensional lambda-calculus: the eta-Postpo-nement theorem, the beta eta-Normal form theorem, and the Norma-lization theorem for beta eta-reduction. These proofs do not involve any special extensions of the standard language of lambda-terms but nevertheless are shorter and much more comprehensive than their known analogues.Institution: Taras Shevchenko National University of Kyiv (Faculty of Cybernetics)
Phone: +38 067 4086768
E-mail:
Phone: +38 067 4086768
E-mail:
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
Fulltext
– 0.12 Mb
Contents
- About FOI-2015
- Semantic Properties of T-consequence Relation in Logics of Quasiary Predicates
- BioMaxP: A Formal Approach for Cellular Ion Pumps
- Structuring of Specification Modules (extended)
- Fundamental theorems of extensional untyped lambda-calculus revisited
- Finite automata over algebraic structures: models and some methods of analysis
- Communicative automata based programming. Society Framework
- The Law of Gravitation for Ontologies and Domains of Discourse
- Solving Problem of Graph Isomorphism by Hybrid Model
