constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
natural deduction metalanguage, practical foundations
type theory (dependent, intensional, observational type theory, homotopy type theory)
computational trinitarianism =
propositions as types +programs as proofs +relation type theory/category theory
Computer science studies programs and languages to express them, as well as the operation, application and design of computers and computer networks. This includes aspects relating to concurrency, semantics of programming languages, and aspects of mathematical logic.
From the nPOV, computer science is part of the computational trinity, together with logic and category theory.
On foundations of programming languages:
On category theory in computer science/programming languages (such as for monads in computer science):
See also:
A suggestion for a classification of structures arising in computer science is in
An old discussion on the n-cat café can be found here. The discussion revolved around
for which also see A Categorical Manifesto.
Other aspects are treated in
Michael Barr, Charles Wells, Category Theory for Computing Science.
Andrea Asperti, Guiseppe Longo, Categories, types and structures, An introduction to category theory for the working computer scientist, M.I.T. Press (out of print, but available online.
Logical Methods in Computer Science is an open access journal for papers on Theoretical Computer Science and other areas of Computer Science in which logical methods play a large part.
Last revised on November 25, 2022 at 07:19:14. See the history of this page for a list of all contributions to it.