| Webster's Online Dictionary |
| Expressions | Domain | Definition | |
| Higher-order macro | Computing | Higher-order macro 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 specializing a call to map in its first argument. See partial evaluation. Source: The Free On-line Dictionary of Computing.. | |
Source: compiled by the editor from various references; see credits. | Top | ||
