Realizability and Parametricity in Pure Type Systems

@inproceedings{Bernardy2011RealizabilityAP,
  title={Realizability and Parametricity in Pure Type Systems},
  author={J Bernardy and Marc Lasson},
  booktitle={FOSSACS},
  year={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… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
21 Citations
28 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Lambda-calcul types et modèles

  • J.-L. Krivine
  • 1990
Highly Influential
4 Excerpts

Towards a practical programming language based on dependent type theory

  • U. Norell
  • PhD thesis, Chalmers Tekniska Högskola,
  • 2007
1 Excerpt

Similar Papers

Loading similar papers…