SRFI 232: An advanced currying form

by Wolfgang Corcoran-Mathe

status: draft (2022-01-07)

keywords: Syntax

Abstract

Scheme lacks a flexible way to create and apply curried procedures. This SRFI describes lambda*, a variant of lambda that creates true curried procedures which also behave just like ordinary Scheme procedures. They can be applied to their arguments one-by-one, all at once, or anywhere in between, without any novel syntax. lambda* also supports nullary and variadic procedures, and procedures created with it have predictable behavior when applied to surplus arguments.