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]])|| [[Naming abstraction]] || A set or collection of unique identifiers.
| Variable ([[alpha-conversion|<math>\alpha</math>-conversion]])|| [[Naming abstraction]] || A collection of symbols(names) that act as unique identifiers.
|-
|-
| Substitution ([[beta-reduction|<math>\beta</math>-reduction]])|| [[Function evaluation]]s || A template or executable function that can be reused in multiple contexts.
| Substitution ([[beta-reduction|<math>\beta</math>-reduction]])|| [[Function evaluation]]s || A template or executable function that can be reused in multiple contexts.

Revision as of 04:10, 20 May 2022

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