Outline of a proof theory of parametricity

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

Volumn 523 LNCS, Issue , 1991, Pages 313-327

  Mairson, Harry G ^a  

^a BRANDEIS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATION THEORY; COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; DIFFERENTIATION (CALCULUS);

COMPUTATIONAL CONTENTS; EQUIVALENCE THEORY; LAMBDA CALCULUS; PARAMETRICITY; PROGRAM EQUIVALENCE; REPRESENTATION THEOREM; SECOND ORDERS; STRUCTURAL INDUCTION;

FUNCTIONAL PROGRAMMING;

EID: 84971824669     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3540543961_15     Document Type: Conference Paper

References (18)

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.
6. J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, 1989.
7. K. Gödel. Über eine bisher noch nict benüte Erweiterung des finiten Standpunktes. Dialectica 12 (1958), pp. 280–287. Republished with English translation and explanatory notes by A. S. Troelstra in Kurt Gödel: Collected Works (Oxford University Press, 1990), vol. II, ed. S. Feferman.
8. W. Howard. The formulae-as-types notion of construction. In To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism, ed. J. Seldin and R. Hindley, pp. 479–490. Academic Press, 1980.
9. D. Leivant. Contracting proofs to programs. In Logic and Computer Science, ed. P. Odifreddi, pp. 279–328. Academic Press, 1990.
10. F. Henglein and H. Mairson. The complexity of type inference for higher-order typed lambda calculi. Proceedings of the 18-th ACM Symposium on the Principles of Programming Languages, January 1991, pp. 119–130.
11. J. C. Mitchell. Type systems for programming languages. Handbook of Theoretical Computer Science, van Leeuwen et al., eds. North-Holland, 1990, pp. 365–458.
12. B. Pierce, S. Dietzen, and S. Michaylov. Programming in higher-order typed lambda calculi. Technical Report CMU-CS-89-111, Carnegie Mellon University, March 1989.
13. J. C. Reynolds. Towards a theory of type structure. In Proceedings of the Paris Colloquium on Programming, Lecture Notes in Computer Science 19, Springer Verlag, pages 408–425, 1974.
14. J. C. Reynolds. Introduction to polymorphic lambda-calculus. In Logical Foundations of Functional Programming, ed. G. Huet, pp. 77–86. Addison Wesley, 1990.
15. J. C. Reynolds. Types, abstraction, and parametric polymorphism. In Information Processing 83, ed. R. E. A. Mason, pp. 513–523. Elsevier, 1983.
16. A. Scedrov. A guide to polymorphic types. In Logic and Computer Science, ed. P. Odifreddi, pp. 387–420. Academic Press, 1990.
17. R. Statman. Logical relations and the typed lambda calculus. Information and Control 65 (1985), pp. 85–97.
18. P. Wadler. Theorems for free! In 4th International Symposium on Functional Programming Languages and Computer Architecture, London, September 1989.