Difference between revisions of "Table/Representable Closure"

From PKC
Jump to navigation Jump to search
(Grammar)
 
(9 intermediate revisions by one other user not shown)
Line 1: Line 1:
{| class="wikitable"
{| class="wikitable"
|+ A table that represent Representable Closure in Abstraction types
|+ A Table that Shows Representable Closure in Abstraction types
|-
|-
! Abstraction types !! Symbolic representation !! Description
! Technical Term !! Abstraction types !! Symbolic representation !! Description
|-
|-
| Variable (<math>\alpha</math> conversion)|| [[namespace]] || A set or collection of unique identifiers.
| [[alpha-conversion|<math>\alpha</math>-conversion]]|| Variable || [[Naming abstraction]] || A collection of symbols (names) that act as unique identifiers.
|-
|-
| Substitution (<math>\beta</math> reduction)|| [[computable function]]s || A template or executable function that can be reused in multiple contexts.
| [[beta-reduction|<math>\beta</math>-reduction]]|| Substitution rule || [[Function evaluation]]s || A template or executable function that can be reused in multiple contexts.
|-
|-
| Composition (<math>\eta</math> reduction)|| [[structural relation]]s || The sequential/structural arrangements of known representables.
| [[eta-composition|<math>\eta</math>-composition]]|| Sequential composition || [[Function composition]] || The sequential/structural arrangements of known representable data.
|}
|}

Latest revision as of 00:49, 2 December 2022

A Table that Shows Representable Closure in Abstraction types
Technical Term Abstraction types Symbolic representation Description
-conversion Variable Naming abstraction A collection of symbols (names) that act as unique identifiers.
-reduction Substitution rule Function evaluations A template or executable function that can be reused in multiple contexts.
-composition Sequential composition Function composition The sequential/structural arrangements of known representable data.