Andreas Abel
Strong Normalization and Equi-(Co)Inductive Types
TLCA, $fields.Year, <$fields.Pages
Arnon Avron
Simple consequence relations
Inf. Comput. v.92, n.1, 1991, 105-140
Arnon Avron
Gentzen-type systems, resolution and tableaux
J. Autom. Reasoning v.10, n.2, 1993, 265-281
Steve Awodey
Category theory
Clarendon Press, 2006
John Bell and Mosh\'{e} Machover
A course in mathematical logic
North-Holland, 1977
Karl Crary
Logical relations and a case study in equivalence checking
Karl Crary and Robert Harper
Syntactic logical relations for polymorphic and recursive types
Electr. Notes Theor. Comput. Sci. v.172, n., 2007, 259-299
Roy L Crole
Categories for types
Cambridge University Press, 1993
Jean-Yves Girard
Proof theory and logical complexity
Bibliopolis, 1987
Jean-Yves Girard, Yves Lafont, and Paul Taylor
Proofs and types

Jean-Yves Girard, Yves Lafont, and Paul Taylor
Proofs and types
Cambridge University Press, 1989
Robert Harper and Frank Pfenning
On equivalence and canonical forms in the lf type theory
ACM Trans. Comput. Log. v.6, n.1, 2005, 61-101
Robert Harper, Furio Honsell, and Gordon D. Plotkin
A framework for defining logics
J. ACM v.40, n.1, 1993, 143-184
Robert Harper
Practical foundations for programming languages
Gérard P. Huet
Confluent reductions: abstract properties and applications to term rewriting systems: abstract properties and applications to term rewriting systems
J. ACM v.27, n.4, 1980, 797-821
Bart Jacobs
Categorical logic and type theory
Elsevier Science, 1999
Andrew Kennedy
Relational Parametricity and Units of Measure
POPL, $fields.Year, <$fields.Pages
Stephen Cole Kleene
Introduction to metamathematics
North-Holland Pub. Co., 1952
Saunders Mac Lane
Categories for the working mathematician
Springer-Verlag, 1971
Harry G. Mairson
Outline of a proof theory of parametricity
Proc. 5th International Symposium on Functional Programming Languages and Computer Architecture, $fields.Year, <$fields.Pages
Per {Martin-L\"{o}f}
Intuitionistic type theory
Bibliopolis, 1984
Per {Martin-L\"{o}f}
On the meanings of the logical constants and the justifications of the logical laws

Per {Martin-L\"{o}f}
On the meanings of the logical constants and the justifications of the logical laws
Nordic Journal of Philosophical Logic v.1, n.1, 1996, 11--60
N. P. Mendler
Inductive types and type constraints in the second-order lambda calculus
Ann. Pure Appl. Logic v.51, n.1-2, 1991, 159-172
Sara Negri and Jan von Plato
Structural proof theory
Cambridge University Press, 2008
Anil Nerode and Richard A. Shore
Logic for applications
Springer, 1997
Jaap van Oosten
Realizability: an introduction to its categorical side
Andrew M. Pitts
Typed operational reasoning
Andrew M. Pitts
Techniques for Contextual Equivalence in Higher-Order, Typed Languages
ESOP, $fields.Year, <$fields.Pages
Andrew M. Pitts
Operational Semantics and Program Equivalence
APPSEM, $fields.Year, <$fields.Pages
John C. Reynolds and Gordon D. Plotkin
On functors expressible in the polymorphic typed lambda calculus
Inf. Comput. v.105, n.1, 1993, 1-29
Sören Stenlund
Combinators, lambda-terms and proof theory
D. Reidel, 1972
Christopher A. Stone and Robert Harper
Extensional equivalence and singleton types
ACM Trans. Comput. Log. v.7, n.4, 2006, 676-722
A. S Troelstra and Helmut Schwichtenberg
Basic proof theory
Cambridge University Press, 2000
A. S Troelstra
Metamathematical investigation of intuitionistic arithmetic and analysis
Springer, 1973
Tarmo Uustalu and Varmo Vene
Mendler-style inductive types, categorically
Nord. J. Comput. v.6, n.3, 1999, 343-
Philip Wadler
Theorems for free
4'th International Conference on Functional Programming and Computer Architecture, $fields.Year, <$fields.Pages
Philip Wadler
The girard-reynolds isomorphism (second edition)
Theoretical Computer Science v.375, n.1-3, 2007, 201-226

Advanced topics in types and programming languages
MIT Press, 2005