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.

[1]  H. B. Curry,et al.  Combinatory Logic, Volume I. , 1961 .

[2]  Cliff B. Jones,et al.  Programming Languages and Their Definition , 1984, Lecture Notes in Computer Science.

[3]  P. J. Landin.  The Mechanical Evaluation of Expressions , 1964, Comput. J..

[4]  A. M. Turing.  The þ-function in λ- K -conversion , 1937 .

[5]  Kenneth E. Iverson,et al.  A programming language , 1899, AIEE-IRE '62 (Spring).

[6]  Hendrik Pieter Barendregt,et al.  Functional Programming and Lambda Calculus , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[7]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[8]  Gerald J. Sussman,et al.  Structure and interpretation of computer programs , 1985, Proceedings of the IEEE.

[9]  Mitchell Wand,et al.  Macro-by-example: Deriving syntactic transformations from their specifications , 1987, POPL '87.

[10]  Christian Queinnec.  Lisp in small pieces , 1994 .

[11]  Daniel P. Friedman,et al.  The little LISPer , 1974 .