Author/Authors :
ERYILMAZ, Aytekin Nevşehir Üniversitesi - Fen Edebiyat Fakültesi - Matematik Bölümü, Turkey , ALBAYRAK, Lütfullah Süleyman Demirel Üniversitesi - Fen Edebiyat Fakültesi - Matematik Bölümü, Turkey
Abstract :
Lamda Calculus was founded in 1930’s by Alanzo Church (Hindley and Seldin, 1986). The systematic and explicit usage of Lamda Calculus were initiated by Peter Landin, Christopher Strachey (Revesz, 1988). The software structure of λ-algorithm has been studied from the point ofdervational techniques by Church (1965), Kleene (1936), Barendregt (1984), Bakker(1975), Byrkıt (1970), Krivine (1993), Levy (1975). In this study, a formal system under the name of theoritical λ-algorithms has been developed.The important elements in it are expressions, functions and operators. The software structure of λ-algorithm, productional techniques and definitions of λ-congruence are given. Under the rules of λ-algorithm, λ-congruences are producted. Later, Ünlü (1976), Mirasyedioğlu (1982, 1987) and Albayrak (1982,1985,1986,1989,1993) were studied λ-algorithms expanded upon algebraic structures.
NaturalLanguageKeyword :
Lamda Calculus , λ , algorithm , λ , congruences
