A Variadic Extension of Curry's Fixed-Point Combinator

Authors:
Mayer Goldberg
Affiliations:
Department of Computer Science, Ben Gurion University, Beer Sheva, Israel 84105
Venue:
Higher-Order and Symbolic Computation
Year:
2005

Citing 7
Cited 0

Programming languages and their definition

Programming languages and their definition
The little LISPer

The little LISPer
Macro-by-example: Deriving syntactic transformations from their specifications

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Functional programming and lambda calculus

Handbook of theoretical computer science (vol. B)
Lisp in small pieces

Lisp in small pieces
Structure and Interpretation of Computer Programs

Structure and Interpretation of Computer Programs
A programming language

A programming language

Quantified Score

Hi-index	0.00

Visualization

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.