Difference between revisions of "Table/Representable Closure"

From PKC
Jump to navigation Jump to search
Line 4: Line 4:
! Abstraction types !! Symbolic representation !! Description
! Abstraction types !! Symbolic representation !! Description
|-
|-
| Variable ([[alpha conversion|<math>\alpha</math> conversion]])|| [[namespace]] || A set or collection of unique identifiers.
| Variable ([[alpha-conversion|<math>\alpha</math>-conversion]])|| [[namespace]] || A set or collection of unique identifiers.
|-
|-
| Substitution ([[beta reduction|<math>\beta</math> reduction]])|| [[computable function]]s || A template or executable function that can be reused in multiple contexts.
| Substitution ([[beta-reduction|<math>\beta</math>-reduction]])|| [[computable function]]s || A template or executable function that can be reused in multiple contexts.
|-
|-
| Composition ([[eta reduction|<math>\eta</math> reduction]])|| [[structural relation]]s || The sequential/structural arrangements of known representables.
| Composition ([[eta-reduction|<math>\eta</math>-reduction]])|| [[structural relation]]s || The sequential/structural arrangements of known representables.
|}
|}

Revision as of 13:38, 19 May 2022

A table that represent Representable Closure in Abstraction types
Abstraction types Symbolic representation Description
Variable (-conversion) namespace A set or collection of unique identifiers.
Substitution (-reduction) computable functions A template or executable function that can be reused in multiple contexts.
Composition (-reduction) structural relations The sequential/structural arrangements of known representables.