Realizability and Parametricity in Pure Type Systems
Paper i proceeding, 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

Författare

Jean-Philippe Bernardy

Chalmers, Data- och informationsteknik, Programvaruteknik

Marc Lasson

Université de Lyon

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 6604 108-122

Styrkeområden

Informations- och kommunikationsteknik

Fundament

Grundläggande vetenskaper

Ämneskategorier

Datavetenskap (datalogi)

DOI

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

ISBN

978-364219804-5