A variadic extension of Curry's fixed-point combinator

DOI10.1007/S10990-005-4881-8MaRDI QIDQ812092zbMATH OpenOpenAlexFDO

Authors Mayer Goldberg

Publication date 23 January 2006

Published in Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10990-005-4881-8

zbMATH Keywords

fixed pointslambda calculusapplicative orderfixed-point combinatorsSchemevariadic functions

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Recommendations

• Fixing \texttt{letrec}: A faithful yet efficient implementation of Scheme's recursive binding construct
• Ellipses and lambda definability
• On structure and extensionality of fixed-point combinators in CL\(w\)
• Publication:3028328
• On the number of fixed points of a combinator in lambda calculus

Cites work

• scientific article; zbMATH DE number 1142317 (Why is no real title available?)
• scientific article; zbMATH DE number 1178950 (Why is no real title available?)
• Combinatory logic. With two sections by William Craig.
• Lisp in Small Pieces
• The Mechanical Evaluation of Expressions
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The þ-function in λ-K-conversion

Cited in

(5)

• Ellipses and lambda definability
• scientific article; zbMATH DE number 1342285 (Why is no real title available?)
• Fixing \texttt{letrec}: A faithful yet efficient implementation of Scheme's recursive binding construct
• scientific article; zbMATH DE number 7226002 (Why is no real title available?)
• The first-order syntax of variadic functions

Describes a project that uses

Uses Software

• APL

This page was built for publication: A variadic extension of Curry's fixed-point combinator

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q812092)