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 ]