SRFI 232: Flexible curried procedures

by Wolfgang Corcoran-Mathe

status: final (2022-04-06)

keywords: Syntax

See also SRFI 26: Notation for Specializing Parameters without Currying and SRFI 219: Define higher-order lambda.


Scheme lacks a flexible way to create and apply curried procedures. This SRFI describes curried, 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. curried also supports nullary and variadic procedures, and procedures created with it have predictable behavior when applied to surplus arguments.