About the Notion of Easiness in lambda-Calculus

• Autorzy: Bertini Y.
• Języki publikacji: PL

Abstrakty

EN

We recall some syntactic techniques used to prove the consistency of some extensions of the lambda-calculus. These techniques are a possible way to prove the easiness of YOmega3.

Słowa kluczowe

EN

easy-terms; consistency; notion of undefined; infinite lambda-calculus

• Wydawca: Wydawnictwo Uniwersytetu Jagiellońskiego
• Czasopismo: Schedae Informaticae
• Rocznik: 2003
• Tom: Vol. 12
• Strony: 67--75
• Opis fizyczny: Bibliogr. 11 poz.

Twórcy

autor

Bertini Y.

• Laboratoire de Mathematiques, Equipe de Logique, Universite de Savoie, 73376 Le Bourget du Lac, France

Bibliografia

• [1] Alessi F., Dezani-Ciancaglini M., Honsell F.; Filter Models and Easy Terms, ICTCS, 2001, pp. 17-37.
• [2] Baeten and Boerboom, fi can be anything it should not be, in: Proc. Koninklijke Nederlandse Akademie van Wetenschappen, Serie A. Indag. Mathematical. Vol. 41, 1979, pp. 111-120.
• [3] Berarducci A.; Church-Rosser X-theones, infinite X-terms and consistency problems, in: W. Hodges and M. Hyland et al., (eds.), Logic: From Foundations to Applications, Oxford Sci. Publ., New York 1996, pp. 33-58.
• [4] Berarducci A.; Infinite X-Calculus and non-sensible models, in: Logic and algebra, Dekker, New York 1996, pp. 330-377.
• [5] Jacopini G.; A condition for identifying two elements of whatever model of Combinatory Logic, in: C. Bohm, (ed.), A-Calculus and Computer Science Theory, Lecture Notes in Computer Science, 1975, p. 37.
• |6] Jacopini G., Zilli M.V.; Equating for recurrent terms of A-calculus and Combinatory Logic, Istituto per le applicazioni del Calcolo, Quaderni serie III. Vol. 85, Roma 1978.
• |7) Jacopini G., Zilli M.V.; Easy terms in the X-calculus, Annales Societatis Mathematicae Polonae. Serie IV: Fundamenta Informaticae VIII, Vol. 2, 1985.
• [8] David R., Nour K.; Storage operators and directed lambda-calculus. The Journal of Symbolic Logic, Vol. 60(4), 1995. pp. 1054-1086.
• [9] David R.; Computing with Böhm tree. Fundamenta Informaticae. Vol. 45(1. 2). 2001, pp. 53-77.
• [10] Mitschke G.; A-Kalkül. 6-conversion und axiornatische Rekursion-theorie, Preprint Nr. 274, Technishe Hochschule, Fachbereit Matematik, Darmstadt, 77 pp., 1976.
• [11] Zylberajch C.; Syntaxe et sémantique de la facilité en lambda-calcul, Ph.D. thesis. Université Paris VII, 1991.