Journal of Symbolic Logic

Compact Bracket Abstraction in Combinatory Logic

Sabine Broda and Luis Damas

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

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 [9]. 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.

Article information

Source
J. Symbolic Logic, Volume 62, Issue 3 (1997), 729-740.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183745295

Mathematical Reviews number (MathSciNet)
MR1472121

Zentralblatt MATH identifier
0894.03007

JSTOR
links.jstor.org

Citation

Broda, Sabine; Damas, Luis. Compact Bracket Abstraction in Combinatory Logic. J. Symbolic Logic 62 (1997), no. 3, 729--740. https://projecteuclid.org/euclid.jsl/1183745295


Export citation