A variadic extension of curry's fixed-point combinator

Mayer Goldberg

doi:10.1007/s10990-005-4881-8

A variadic extension of curry's fixed-point combinator

Mayer Goldberg

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

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.

Original language	English
Pages (from-to)	371-388
Number of pages	18
Journal	Higher-Order and Symbolic Computation
Volume	18
Issue number	3-4
DOIs	https://doi.org/10.1007/s10990-005-4881-8
State	Published - 1 Dec 2005

Keywords

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

ASJC Scopus subject areas

Software
Computer Science Applications

Access to Document

10.1007/s10990-005-4881-8

Cite this

@article{6ca143f50e5242a581263ad0b974fde8,

title = "A variadic extension of curry's fixed-point combinator",

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 = "Applicative order, Fixed points, Fixed-point combinators, Lambda-calculus, Scheme, Variadic functions",

author = "Mayer Goldberg",

note = "Funding Information: 2. Basic Research in Computer Science (www.brics.dk), funded by the Danish National Research Foundation.",

year = "2005",

month = dec,

day = "1",

doi = "10.1007/s10990-005-4881-8",

language = "English",

volume = "18",

pages = "371--388",

journal = "Higher-Order and Symbolic Computation",

issn = "1388-3690",

publisher = "Springer Netherlands",

number = "3-4",

}

TY - JOUR

T1 - A variadic extension of curry's fixed-point combinator

AU - Goldberg, Mayer

N1 - Funding Information: 2. Basic Research in Computer Science (www.brics.dk), funded by the Danish National Research Foundation.

PY - 2005/12/1

Y1 - 2005/12/1

N2 - 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.

AB - 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.

KW - Applicative order

KW - Fixed points

KW - Fixed-point combinators

KW - Lambda-calculus

KW - Scheme

KW - Variadic functions

UR - http://www.scopus.com/inward/record.url?scp=28244435709&partnerID=8YFLogxK

U2 - 10.1007/s10990-005-4881-8

DO - 10.1007/s10990-005-4881-8

M3 - Article

AN - SCOPUS:28244435709

SN - 1388-3690

VL - 18

SP - 371

EP - 388

JO - Higher-Order and Symbolic Computation

JF - Higher-Order and Symbolic Computation

IS - 3-4

ER -

A variadic extension of curry's fixed-point combinator

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this