This entry is about the notion in computer science. For the notion in particle physics/quantum gravity see at string theory.
constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
In computer science, “” is a traditional name for the data type of lists of elements of a given alphabet .
From the point of view of categorical semantics, the data type equipped with its evident concatenation functionality is the free monoid on .
Moreover, from the point of view of monads in functional programming, the writing of consecutive log messages of type is desribed by the writer monad
See also:
Last revised on August 14, 2023 at 18:01:30. See the history of this page for a list of all contributions to it.