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
constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
A formal language (theory) for expressing programs. Used and studied in computer science.
general
plain type theory:
On category theory in computer science/programming languages (such as for monads in computer science):
Use of adjunctions in programming languages:
Ralf Hinze, Generic Programming with Adjunctions, In: J. Gibbons (ed.) Generic and Indexed Programming Lecture Notes in Computer Science, vol 7470. Springer 2012 (pdf, slides doi:10.1007/978-3-642-32202-0_2)
Jeremy Gibbons, Fritz Henglein, Ralf Hinze, Nicolas Wu, Relational Algebra by Way of Adjunctions, Proceedings of the ACM on Programming Languages archive Volume 2 Issue ICFP, September 2018 Article No. 86 (pdf, doi:10.1145/3236781)
Last revised on November 25, 2022 at 07:10:58. See the history of this page for a list of all contributions to it.