Explicit Substitutions and Intersection Types

• Autorzy: Lescanne P.
• Języki publikacji: PL
• Wydawca: Wydawnictwo Uniwersytetu Jagiellońskiego
• Czasopismo: Schedae Informaticae
• Rocznik: 2003
• Tom: Vol. 12
• Strony: 11--15
• Opis fizyczny: Bibliogr. 12 poz.

Twórcy

autor

Lescanne P.

• LIP, Ecole Normale superieure de Lyon, 43 allee d'Italie 69364 Lyon France,

Bibliografia

• [1] Abadi M., Cardelli L., Curien P.L., Lévy J.J.; Explicit substitutions, Journal of Functional Programming, Vol. 1(4), 1991, pp. 375-416.
• [2] Benaissa Z., Briaud D., Lescanne P., Rouyer-Degli J.; Xv, a calculus of explicit substitutions which preserves strong normalization, Journal of Functional Programming, September 1996, Vol. 6(5), pp. 699-722.
• [3] Bloo R., Rose K.H.; Preservation of strong normalisation in named lambda calculi with explicit substitution and garbage collection, in: CSN ’95 - Computer Science in the Netherlands, November 1995, pp. 62-72.
• [4] Curien P.L.; Categoncal combinators, Information and Control, Vol. 69, 1986, pp. 188-254.
• [5] Curry H.B., Feys R., Craig W.; Combinatory Logic, Elsevier Science Publishers B. V. (North-Holland), Vol. 1, Amsterdam 1958.
• [6] Bruijn de N.G.; Lambda calculus with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem, in. Proc. Koninkl. Nederl. Akademie van Wetenschappen, Vol. 75(5), 1972, pp. 381-392.
• [7] Bruijn de N.G.: A namefree lambda calculus with facilities for internal definition of expressions and segments, TH-Report 78-WSK-03, Iechnological University Eindhoven, Netherlands, Department of Mathematics, 19(8.
• [8] Dougherty D., Lescanne P.; Reductions, intersection types, and explicit substitutions, Mathematical Structures in Computer Science, 2001.
• [9] Lengrand S., Dougherty D., Lescarme P.; An improved system of intersection types for explicit substitutions, in: R. Baeza-Yates, U. Montanari, and N. Santoro, (eds.), Foundations of Information Technology in the Era of Network and Mobile Computing, Kluwer Academic Publishers, 2002, pp. 511-524.
• [10] Lescanne P., Rouyer-Degli J.; Explicit substitutions with de Bruijn’s levels, in: J. Hsiang, (ed.), Proceedings 6th Conference on Rewriting Techniques and Ap-plications, Kaiserslautern (Germany), Lecture Notes in Computer Science, Springer-Verlag, Vol. 914, 1995, pp. 294-308.
• [11] Lins R.; A new formula for the execution of categorial combinators, in: Proceedings 8th International Conference on Automated Deduction, Oxford (UK), Lecture Notes in Computer Science, Springer-Verlag, Vol. 230,1986, pp. 89-98.
• [12] Bakel van S., Dezani-Ciancaglini M.; Characterizing strong normalization for explicit substitutions, in: LATIN’02, Lecture Notes in Computer Science, Springer-Verlag, Vol. 2286, 2002, pp. 356-370.