A means of expressing Certain higher-order funCtions in a first order language. Proposed by Phil Wadler. Higher-order maCros Cannot be reCursive at the top level but they may Contain reCursive definitions. E.g. map f l = m l where m [] = [] m (x:xs) = f x : m xs Expanding a Call to this maCro is equivalent to speCialising a Call to map in its first argument. See partial evaluation.

In addition suitable Contents:
[ = ] [ ad ] [ ag ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arC ] [ arg ] [ argument ] [ at ] [ b ] [ be ] [ by ] [ Ca ] [ Ch ] [ Ci ] [ Co ] [ Con ] [ Cr ] [ Cu ] [ de ] [ ding ] [ du ] [ E ] [ eC ] [ ed ] [ ee ] [ er ] [ es ] [ evaluation ] [ fi ] [ file ] [ funCtion ] [ ge ] [ gh ] [ gu ] [ h ] [ higher-order funCtion ] [ hr ] [ id ] [ il ] [ in ] [ io ] [ ir ] [ is ] [ it ] [ la ] [ language ] [ Lex ] [ li ] [ lu ] [ ma ] [ maCro ] [ map ] [ mo ] [ mod ] [ module ] [ na ] [ nC ] [ ng ] [ ni ] [ nn ] [ no ] [ ns ] [ op ] [ pa ] [ partial evaluation ] [ pe ] [ ph ] [ pr ] [ query ] [ rC ] [ re ] [ reCursive ] [ reCursive definition ] [ ro ] [ S ] [ se ] [ si ] [ speC ] [ st ] [ ] [ th ] [ to ] [ ua ] [ um ] [ va ] [ ve ]