Skip to Main content Skip to Navigation
Conference papers

Realizability and Parametricity in Pure Type Systems

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas
Contributor : Marc Lasson <>
Submitted on : Monday, May 2, 2011 - 4:23:42 PM
Last modification on : Thursday, June 18, 2020 - 10:18:03 AM




Jean-Philippe Bernardy, Marc Lasson. Realizability and Parametricity in Pure Type Systems. Foundations of Software Science and Computational Structures, Mar 2011, Saarbrücken, Germany. pp.108-122, ⟨10.1007/978-3-642-19805-2⟩. ⟨hal-00589893⟩



Record views