Outline of a proof theory of parametricity-Reference-Cited by-同舟云学术

Outline of a proof theory of parametricity

Published:1991 Issue: Volume: Page:313-327
ISSN:0302-9743
Container-title:Functional Programming Languages and Computer Architecture
language:
Short-container-title:

Author:

Mairson Harry G.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3540543961_15.pdf

Reference18 articles.

1. R. Bird and P. Wadler. Introduction to Functional Programming. Prentice-Hall, 1988.

2. C. Böhm and A. Berarducci. Automatic synthesis of typed λ-programs on term algebras. Theoretical Computer Science 39, pp. 135–154.

3. K. Bruce, J. C. Mitchell, and A. R. Meyer. The semantics of second-order lambda-calculus. In Logical Foundations of Functional Programming, ed. G. Huet, pp. 213–272. Addison Wesley, 1990.

4. D. van Daalen. Logic and Structure. Springer-Verlag, 1979.

5. J.-Y. Girard, Interprétation Fonctionelle et Elimination des Coupures de l'Arithmetique d'Ordre Superieur. Thèse de Doctorat d'Etat, Université de Paris VII, 1972.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Realizability and Parametricity in Pure Type Systems;Foundations of Software Science and Computational Structures;2011

2. The Girard–Reynolds isomorphism;Information and Computation;2003-11

3. Semantic and Syntactic Approaches to Simulation Relations;Mathematical Foundations of Computer Science 2003;2003

4. Axiomatic Criteria for Quotients and Subobjects for Higher-Order Data Types;Automata, Languages and Programming;2003

5. Abstraction Barrier-Observing Relational Parametricity;Lecture Notes in Computer Science;2003