Difference between revisions of "Table/Lambda Calculus abstractions"
Jump to navigation
Jump to search
| Line 8: | Line 8: | ||
|- | |- | ||
| Composition (<math>\eta</math> reduction)|| (''M'' ''N'') || Specifying the sequential composition of multiple lambda expressions such as ''M'' and ''N''. | | Composition (<math>\eta</math> reduction)|| (''M'' ''N'') || Specifying the sequential composition of multiple lambda expressions such as ''M'' and ''N''. | ||
| | |+ A Table representing [[Lambda calculus]] and its abstraction types. | ||
|} | |} | ||
Revision as of 15:56, 13 May 2022
| Admissible data types | Symbolic representation | Description |
|---|---|---|
| Variable ( conversion) | x | A character or string representing a parameter or mathematical/logical value. |
| Substitution ( reduction) | (λx.M)(value to be bound to x) | This expression specifies how function is defined by replacing values of bound variable x in the lambda (λ) expression M. |
| Composition ( reduction) | (M N) | Specifying the sequential composition of multiple lambda expressions such as M and N. |
