Variable substitution with iconic combinators
An iconic notation for representing combinators is introduced, and the extensions of combinatory logic needed to work with it are developed. It is shown how entire sets of combinators can be defined by just two rules for constructing and interpreting iconic names. The two rules — a general abstraction rule and a general reduction rule — are the only ones required to perform variable substitution. It is suggested that techniques using the results reported here may have advantages over other combinator-based methods for implementing a functional language.
Unable to display preview. Download preview PDF.
- Church, A.: The Calculi of Lambda Conversion. Princeton University Press (1941)Google Scholar
- Curry, H.B.: The Elimination of Variables by Regular Combinators. In Bunge, (ed): The Critical Approach to Science and Philosophy. Collier-Macmillan (1964) 127–143Google Scholar
- Curry, H.B., Feys, R.: Combinatory Logic vol I. Amsterdam, North-Holland (1958)Google Scholar
- Joy, M.S., Rayward-Smith, V.J., Burton, F.W.: Efficient Combinator Code. Computer Languages 10 (1985) 211–224Google Scholar
- Smullyan, R.: To Mock a Mockingbird. Alfred A. Knopf (1985)Google Scholar
- Stevens, D.: Bracket Abstraction Algorithm D. CSIRP-91-4, School of Computer Science, University of Birmingham (1991)Google Scholar
- Stevens, D.: Variable Substitution with Iconic Combinators. CSIRP-92-6, School of Computer Science, University of Birmingham (1992a)Google Scholar
- Stevens, D.: Compiling a Functional Language with Iconic Combinators. CSIRP-92-7, School of Computer Science, University of Birmingham (1992b)Google Scholar
- Turner, D.A.: Another Algorithm for Bracket Abstraction. The Journal of Symbolic Logic 44 (1979a) 267–270Google Scholar
- Turner, D.A.: A New Implementation Technique for Applicative Languages. Software— Practice and Experience 9 (1979b) 31–49Google Scholar