Functors are Type Refinement Systems

Paul-André Melliès, Noam Zeilberger

Research output: Contribution to journalArticlepeer-review


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. The main purpose of this paper is to describe the general framework (which can also be seen as providing a categorical analysis of refinement types), and to present a few applications. As a larger case study, we revisit Reynolds’ paper on “The Meaning of Types” (2000), showing how the paper’s main results may be reconstructed along these lines
Original languageEnglish
Pages (from-to)3-16
Number of pages14
JournalACM SIGPLAN Notices
Issue number1
Publication statusPublished - Jan 2015


  • type theory
  • category theory
  • refinement types


Dive into the research topics of 'Functors are Type Refinement Systems'. Together they form a unique fingerprint.

Cite this