Combinatory weak reduction in lambda calculus
Yazarlar (2)
Prof. Dr. Naim ÇAĞMAN Tokat Gaziosmanpaşa Üniversitesi, Türkiye
Jr Hindley
Swansea University, İngiltere
Swansea University, İngiltere
| Makale Türü |
Özgün Makale
(SSCI, AHCI, SCI, SCI-Exp dergilerinde yayınlanan tam makale)
|
||
| Dergi Adı | Theoretical Computer Science (Q4) | ||
| Dergi ISSN | 0304-3975 Wos Dergi Scopus Dergi | ||
| Dergi Tarandığı Indeksler | SCI | ||
| Makale Dili | İngilizce | Basım Tarihi | 01-1998 |
| Cilt / Sayı / Sayfa | 198 / 1 / 239–247 | DOI | 10.1016/S0304-3975(97)00250-8 |
| Makale Linki | Theoretical Computer Science | ||
| UAK Araştırma Alanları |
Matematiğin Temelleri ve Matematiksel Mantık
|
||
| Özet |
| Combinatory logic claims to do the same work as λ-calculus but with a simpler language and a simpler reduction process. In a sense this claim is true: the classical reduction process in λ-calculus is indeed more complex than that in Combinatory logic. But by changing its definition only slightly one can define in λ-calculus a perfect analogue of combinatory reduction. This analogue was first formulated 30 years ago but it is still not as well known as it deserves, so in the present purely expository paper we shall try to make it more accessible. We shall discuss its definition, motivation and its neat relation to substitution. |
| Anahtar Kelimeler |
Science Direct
Combinatory weak reduction in lambda calculus
BM Sürdürülebilir Kalkınma Amaçları
| Atıf Sayıları | |
| Web of Science | 15 |
| Scopus | 22 |
| Google Scholar | 46 |