Journal of Symbolic Logic 62 (3):729-740 (1997)
|Abstract||Translations from Lambda calculi into combinatory logics can be used to avoid some implementational problems of the former systems. However, this scheme can only be efficient if the translation produces short output with a small number of combinators, in order to reduce the time and transient storage space spent during reduction of combinatory terms. In this paper we present a combinatory system and an abstraction algorithm, based on the original bracket abstraction operator of Schonfinkel . The algorithm introduces at most one combinator for each abstraction in the initial Lambda term. This avoids explosive term growth during successive abstractions and makes the system suitable for practical applications. We prove the correctness of the algorithm and establish some relations between the combinatory system and the Lambda calculus|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
S. Kamal Abdali (1976). An Abstraction Algorithm for Combinatory Logic. Journal of Symbolic Logic 41 (1):222-224.
M. W. Bunder (1988). Arithmetic Based on the Church Numerals in Illative Combinatory Logic. Studia Logica 47 (2):129 - 143.
Henk Barendregt, Martin Bunder & Wil Dekkers (1993). Systems of Illative Combinatory Logic Complete for First-Order Propositional and Predicate Calculus. Journal of Symbolic Logic 58 (3):769-788.
J. Roger Hindley (1986). Introduction to Combinators and [Lambda]-Calculus. Cambridge University Press.
J. W. Klop (1980). Combinatory Reduction Systems. Mathematisch Centrum.
Sachio Hirokawa (1992). The Converse Principal Type-Scheme Theorem in Lambda Calculus. Studia Logica 51 (1):83 - 95.
Katalin Bimbó (2003). The Church-Rosser Property in Dual Combinatory Logic. Journal of Symbolic Logic 68 (1):132-152.
Katalin Bombó (2005). The Church-Rosser Property in Symmetric Combinatory Logic. Journal of Symbolic Logic 70 (2):536 - 556.
Martin W. Bunder, J. Roger Hindley & Jonathan P. Seldin (1989). On Adding (Ξ) to Weak Equality in Combinatory Logic. Journal of Symbolic Logic 54 (2):590-607.
M. W. Bunder (2000). Expedited Broda-Damas Bracket Abstraction. Journal of Symbolic Logic 65 (4):1850-1857.
Added to index2009-01-28
Total downloads2 ( #246,081 of 722,864 )
Recent downloads (6 months)1 ( #60,917 of 722,864 )
How can I increase my downloads?