Difference between revisions of "Table/Representable Closure"

Revision as of 04:05, 20 May 2022

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

@@ Line 4: / Line 4: @@
 ! 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 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]])|| [[Function evaluation]]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]])|| [[Function composition]] || The sequential/structural arrangements of known representable data.
 |}