ABSTRACT A Variadic Extension of Curry’s Fixed-Point Combinator
by
Mayer Goldberg
| Citations: | 1 - 0 self |
BibTeX
@MISC{Goldberg_abstracta,
author = {Mayer Goldberg},
title = {ABSTRACT A Variadic Extension of Curry’s Fixed-Point Combinator},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a systematic construction of a variadic applicative-order multiple fixed-point combinator in Scheme. The resulting Scheme procedure is a variadic extension of the n-ary version of Curry’s fixed-point combinator. It can be used to create mutually-recursive procedures, and expand arbitrary letrec-expressions.
Citations
| 299 | The mechanical evaluation of expressions - Landin - 1964 |
| 51 | with Julie Sussman, Structure and Interpretation of Computer Programs - Abelson, Sussman - 1985 |
| 9 | The Little LISPer - Friedman - 1986 |
| 1 | Functional Programming and the λ-calculus - Barendregt - 1990 |
| 1 | Programming Languages and Their Definition. Number 177 - Bekič - 1984 |
