Dr. Mayer Goldberg
Know all about my research
A variadic extension of curry's fixed-point combinator
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 letrec-expressions.
| Publication language | English |
| Pages | 371-388 |
| Journal | Higher-Order and Symbolic Computation |
| Volume | 18 |
| Issue number | 3-4 |
| Publication status | Published - 01.12.2005 |
Keywords
Applicative order
Fixed points
Fixed-point combinators
Lambda-calculus
Scheme
Variadic functions
ASJC Scopus subject areas
Software
Computer Science Applications
