| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 830 3 |
| Ultima descărcare din IBN: 2017-04-26 18:36 |
| Căutarea după subiecte similare conform CZU |
| 519.7:004.94 (1) |
| Cibernetică matematică (94) |
| Informatică aplicată. Tehnici bazate pe calculator cu aplicații practice (440) |
 SM ISO690:2012LYALETSKY, Alexandre. Fundamental theorems of extensional untyped lambda-calculus revisited. In: Computer Science Journal of Moldova, 2015, nr. 2(68), pp. 153-164. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 2(68) / 2015 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 519.7:004.94 | ||||||
| Pag. 153-164 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
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. |
||||||
| Cuvinte-cheie extensional untyped λ-calculus, βη-reduction, postponement of η-reduction, η-Postponement theorem, βη-Normal form theorem, Normalization theorem for βη-reduction |
||||||
|
|
|
|
