Realizability and Parametricity in Pure Type Systems

  • Jean-Philippe Bernardy
  • Marc Lasson
Conference paper

DOI: 10.1007/978-3-642-19805-2_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6604)
Cite this paper as:
Bernardy JP., Lasson M. (2011) Realizability and Parametricity in Pure Type Systems. In: Hofmann M. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2011. Lecture Notes in Computer Science, vol 6604. Springer, Berlin, Heidelberg


We describe a systematic method to build a logic from any programming language described as a Pure Type System (PTS). The formulas of this logic express properties about programs. We define a parametricity theory about programs and a realizability theory for the logic. The logic is expressive enough to internalize both theories. Thanks to the PTS setting, we abstract most idiosyncrasies specific to particular type theories. This confers generality to the results, and reveals parallels between parametricity and realizability.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Jean-Philippe Bernardy
    • 1
    • 2
  • Marc Lasson
    • 3
  1. 1.Chalmers University of TechnologySweden
  2. 2.University of GothenburgSweden
  3. 3.LIP (UMR 5668 CNRS ENS Lyon UCBL INRIA)ENS Lyon, Université de LyonFrance

Personalised recommendations