Difference between revisions of "Table/Representable Closure"

Revision as of 04:12, 20 May 2022

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

@@ Line 2: / Line 2: @@
 |+ A table that represent Representable Closure in Abstraction types
 |-
-! Abstraction types !! Symbolic representation !! Description
+! Technical Term !! Abstraction types !! Symbolic representation !! Description
 |-
-| Variable ([[alpha-conversion|<math>\alpha</math>-conversion]])|| [[Naming abstraction]] || A collection of symbols(names) that act as unique identifiers.
+| [[alpha-conversion|<math>\alpha</math>-conversion]]|| Variable || [[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.
+| [[beta-reduction|<math>\beta</math>-reduction]]|| Substitution rule || [[Function evaluation]]s || A template or executable function that can be reused in multiple contexts.
 |-
-| Composition ([[eta-reduction|<math>\eta</math>-reduction]])|| [[Function composition]] || The sequential/structural arrangements of known representable data.
+| [[eta-reduction|<math>\eta</math>-reduction]])|| Composition || [[Function composition]] || The sequential/structural arrangements of known representable data.
 |}