Difference between revisions of "Table/Representable Closure"

Revision as of 08:28, 31 August 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$ -composition	Sequential composition	Function composition	The sequential/structural arrangements of known representable data.

@@ Line 8: / Line 8: @@
 | [[beta-reduction|<math>\beta</math>-reduction]]|| Substitution rule || [[Function evaluation]]s || A template or executable function that can be reused in multiple contexts.
 |-
-| [[eta-reduction|<math>\eta</math>-reduction]]|| Sequential composition || [[Function composition]] || The sequential/structural arrangements of known representable data.
+| [[eta-composition|<math>\eta</math>-composition]]|| Sequential composition || [[Function composition]] || The sequential/structural arrangements of known representable data.
 |}