Extracting &ohgr;'s programs from proofs in the calculus of constructions
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Journal of Information Processing and Cybernetics
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Formal parametric polymorphism
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of logic in computer science (vol. 2)
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Lambda-calculus, types and models
Lambda-calculus, types and models
A Logic for Parametric Polymorphism
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Outline of a Proof Theory of Parametricity
Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
Realizability: a historical essay
Mathematical Structures in Computer Science
Journal of Functional Programming
The Girard—Reynolds isomorphism (second edition)
Theoretical Computer Science
Parametricity and dependent types
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Testing polymorphic properties
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Controlling program extraction in light logics
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Modularising inductive families
Proceedings of the seventh ACM SIGPLAN workshop on Generic programming
A Computational Interpretation of Parametricity
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Transporting functions across ornaments
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Hi-index | 0.00 |
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.