A variadic extension of curry's fixed-point combinator

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


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.

Original languageEnglish
Pages (from-to)371-388
Number of pages18
JournalHigher-Order and Symbolic Computation
Issue number3-4
StatePublished - 1 Dec 2005


  • Applicative order
  • Fixed points
  • Fixed-point combinators
  • Lambda-calculus
  • Scheme
  • Variadic functions

ASJC Scopus subject areas

  • Software
  • Computer Science Applications

Cite this