2014 · 44 citations · 21 references
Language StudiesComputer ScienceFormal MethodsSemanticsSyntaxCategory TheoryData TypesFormal SemanticsSyntax-semantics InterfaceTaxonomyType SystemsCategorical SemanticsCategory-theoretic FoundationsFunctorsType ClassesType Theory
The standard reading of type theory through the lens of category theory is based on the idea of viewing a type system as a category of well-typed terms. We propose a basic revision of this reading: rather than interpreting type systems as categories, we describe them as functors from a category of typing derivations to a category of underlying terms. Then, turning this around, we explain how in fact any functor gives rise to a generalized type system, with an abstract notion of typing judgment, typing derivations and typing rules. This leads to a purely categorical reformulation of various natural classes of type systems as natural classes of functors.
21
An axiomatic basis for computer programming
C. A. R. Hoare · Communications of the ACM · 1969 · 3.9K citations · Full text
Separation logic: a logic for shared mutable data structures
John Reynolds · 2003 · 2.2K citations
The Mathematics of Sentence Structure
Joachim Lambek · American Mathematical Monthly · 1958 · 1.3K citations
Introduction to Higher Order Categorical Logic.
J. L. Bell, J. Lambek, Philip Scott · Journal of Symbolic Logic · 1989 · 1.1K citations
Humanities, Mathematics, Logic +11