A variadic extension of Curry's fixed-point combinator

DOI10.1007/S10990-005-4881-8zbMATH Open1083.68015OpenAlexW2121105821MaRDI QIDQ812092FDOQ812092

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

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

zbMATH Keywords

fixed pointslambda calculusapplicative orderfixed-point combinatorsSchemevariadic functions

Mathematics Subject Classification ID

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

Cites Work

• Combinatory logic. With two sections by William Craig.
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The þ-function in λ-K-conversion
• The Mechanical Evaluation of Expressions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lisp in Small Pieces

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• The first-order syntax of variadic functions
• Fixing \texttt{letrec}: A faithful yet efficient implementation of Scheme's recursive binding construct

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)