Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Computing | Lambda abstraction A term in lambda-calculus denoting a function. A lambda abstraction begins with a lower-case lambda (represented as "\" in this document), followed by a variable name (the "bound variable"), a full stop and a lambda expression (the body). The body is taken to extend as far to the right as possible so, for example an expression, \ x . \ y . x+y is read as \ x . (\ y . x+y). A nested abstraction such as this is often abbreviated to: \ x y . x + y The lambda expression (\ v . E) denotes a function which takes an argument and returns the term E with all free occurrences of v replaced by the actual argument. Application is represented by juxtaposition so (\ x . x) 42 represents the identity function applied to the constant 42. A lambda abstraction in Lisp is written as the symbol lambda, a list of zero or more variable names and a list of zero or more terms, e.g. (lambda (x y) (plus x y)) Lambda expressions in Haskell are written as a backslash, "\", one or more patterns (e.g. variable names), "->" and an expression, e.g. \ x -> x. (1995-01-24). Source: The Free On-line Dictionary of Computing. |
Source: compiled by the editor from various references; see credits. | |
(From Wikipedia, the free Encyclopedia)
More specifically, a lambda abstraction is a lambda expression with no free variables: each its variables is bound by some lambda. E.g.
For example, λ could stand for 'for each', 'for some', or 'there is'. In this case, the expression could stand for a 'logic proposition'.
Source: adapted by the editor from Wikipedia, the free encyclopedia under a copyleft GNU Free Documentation License (GFDL) from the article "Lambda abstraction."
Crosswords: LAMBDA ABSTRACTION |
| Specialty definitions using "LAMBDA ABSTRACTION": alpha conversion ♦ beta abstraction, beta reduction, bound variable ♦ constant applicative form ♦ head normal form ♦ name capture ♦ principal type ♦ Weak Head Normal Form. (references) |
Scrabble® Enable2K-Verified Anagrams | |
| Words within the letters "a-a-a-a-b-b-c-d-i-l-m-n-o-r-s-t-t" | |
-4 letters: abstractional. | |
-5 letters: amobarbitals. | |
| Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)4C 41 4D 42 44 41 41 42 53 54 52 41 43 54 49 4F 4E |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01001100 01000001 01001101 01000010 01000100 01000001 00100000 01000001 01000010 01010011 01010100 01010010 01000001 01000011 01010100 01001001 01001111 01001110 |
HTML Code (1990) (references)L A M B D A   A B S T R A C T I O N |
ISO 10646 (1991-1993) (references)004C 0041 004D 0042 0044 0041 0041 0042 0053 0054 0052 0041 0043 0054 0049 004F 004E |
Encryption (beginner's substitution cypher): (references)46354736383523536535452353754434948 |
| 1. Crosswords 2. Anagrams 3. Orthography 4. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
