Realizability and Parametricity in Pure Type Systems
Paper in proceedings, 2011

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.

parametricity realizability PTS

Author

Jean-Philippe Bernardy

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Marc Lasson

Université de Lyon

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 6604 108-122

Areas of Advance

Information and Communication Technology

Roots

Basic sciences

Subject Categories

Computer Science

DOI

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

ISBN

978-364219804-5

More information

Created

10/7/2017