Difference between revisions of "Table/Lambda Calculus abstractions"

From PKC
Jump to navigation Jump to search
Line 1: Line 1:
{| class="wikitable"
{| class="wikitable"
|+ A Table representing [[Lambda calculus]] and its abstraction types.
|-
|-
! Admissible data types !! Symbolic representation !! Description
! Admissible data types !! Symbolic representation !! Description
Line 8: Line 9:
|-
|-
| 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:57, 13 May 2022

A Table representing Lambda calculus and its abstraction types.
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.