Higher-Order and Symbolic Computation

, Volume 18, Issue 3, pp 371–388

A Variadic Extension of Curry's Fixed-Point Combinator

Authors

    • Department of Computer ScienceBen Gurion University
Article

DOI: 10.1007/s10990-005-4881-8

Cite this article as:
Goldberg, M. Higher-Order Symb Comput (2005) 18: 371. doi:10.1007/s10990-005-4881-8
  • 31 Views

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 letrec-expressions.

Keywords

fixed pointsfixed-point combinatorsapplicative orderlambda-calculusSchemevariadic functions

Copyright information

© Springer Science + Business Media, Inc. 2005