The Girard-Reynolds isomorphism

Information and Computation

Volumn 186, Issue 2, 2003, Pages 260-284

  Wadler, Philip ^a  

^a AVAYA LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; FORMAL LOGIC; THEOREM PROVING;

CALCULUS;

INFORMATION SCIENCE;

EID: 0142121531     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00141-X     Document Type: Conference Paper

References (42)

1. M. Abadi, L. Cardelli, P.-L. Curien, Formal parametric polymorphism, Theoretical Computer Science 121 (1-2) (1993) 9-58.
2. H. Barendregt, The Lambda Calculus ((Part of A Collection of Contributions in Honour of Corrado Boehm on the Occasion of his 70th Birthday.) Also appeared as SRC Research Report 109), North-Holland, 1980.
3. H. Barendregt, The Lambda Calculus ((Part of A Collection of Contributions in Honour of Corrado Boehm on the Occasion of his 70th Birthday.) Also appeared as SRC Research Report 109), North-Holland, 1980.
4. H. Barendregt, Introduction to generalized types systems, Journal of Functional Programming 1 (2) (1991) 125-154.
5. E.S. Bainbridge, P.J. Freyd, A. Scedrov, P.J. Scott, Functorial polymorphism, in: G. Huet (Ed.), Logical Foundations of Functional Programming, Addison-Wesley, 1990, pp. 315-330.
6. C. Böhm, A. Berarducci, Automatic synthesis of typed Λ-programs on term algebras, Theoretical Computer Science 39 (2-3) (1985) 135-154.
7. V. Breazu-Tannen, T. Coquand, Extensional models for polymorphism, Theoretical Computer Science 59 (1988) 85-114.
8. H.B. Curry, R. Feys, Combinatory Logic, North Holland, 1958.
9. T. Coquand, G. Huet, The calculus of constructions, Information and Computation 76 (1988) 95-120.
10. R. Constable, et al., Implementing mathematics with the Nuprl proof development system, Prentice-Hall, 1986.
11. N.G. de Bruijn, The mathematical language of AUTOMATH, its usage and some of its extensions, in: Proceedings of the Symposium on Automatic Demonstration, LNCS 125, Springer-Verlag, 1970.
12. L. Damas, R. Milner, Principal type schemes for functional programs, in: 9th Annual Symposium on Principles of Programming Languages, Albuquerque, NM, ACM, January 1982.
13. Gottlob Frege. Begriffsschrift, a formula language, modeled upon that of arithmetic, for pure thought (1879), in: Jan van Heijenoort (Ed.), From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931, Harvard University Press, 1967.
14. J.-Y. Girard, Interprétation functionelle et élimination des coupures dans l'arithmétique d'ordre supérieure, Ph.D. Thesis, Université Paris VII, 1972.
15. J.-Y. Girard, Y. Lafont, P. Taylor, Proofs and Types, Cambridge University Press, 1989.
16. R. Hasegawa, Categorical data types in parametric polymorphism, Mathematical Structures in Computer Science 4 (1994) 71-109.
17. R. Hindley, The principal type scheme of an object in combinatory logic, Transactions of the Americain Mathematical Society 146 (December) (1969) 29-60.
18. W.A. Howard, The formulae-as-types notion of construction, in J. P. Seldin and J. R. Hindley (Eds.), To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism, Academic Press, 1980 (The original version was circulated privately in 1969.).
19. J.-L. Krivine, M. Parigot, Programming with proofs, Journal of Information Processing and Cybernetics (EIK), 26(3) 149-167, 1990 (Revised version of a lecture presented at the 6th International Symposium on Computation Theory, (SCT '87), Wednisch-Rietz, GDR, 30 November-4 December 1987.).
20. D. Leivant, Reasoning about functional programs and complexity classes associated with type disciplines, 24th Symposium on Foundations of Computer Science, Washington DC, IEEE, 1983, pp. 460-469.
21. D. Leivant, Contracting proofs to programs, in: P. Odifreddi (Ed.), Logic and Computer Science, Academic Press, 1990.
22. H. Mairson, Outline of a proof theory of parametricity, in: J. Hughes (Ed.), 5th International Conference on Functional Programming Languages and Computer Architecture, Cambridge, Massachusetts, LNCS 523, Springer-Verlag, August 1991.
23. P. Martin-Löf, Constructive mathematics and computer programming, in: 6th International Congress for Logic, Methodology, and Philosophy of Science, North Holland, 1982, pp. 153-175.
24. R. Milner, A theory of type polymorphism in programming, Journal of Computers and Systems Science 17 (1978) 348-375.
25. E. Moggi, Communication to the Types electronic forum, 10 February 1986.
26. Q. Ma, J.C. Reynolds, Types, abstraction, and parametric polymorphism, part 2, in: S. Brookes et al. (Eds.), Mathematical Foundations of Programming Semantics, LNCS, Springer-Verlag, 1991.
27. A.M. Pitts, Polymorphism is set theoretic, constructively, in: D.H. Pitt, A. Poigné, D.E. Rydeheard (Eds.), Category Theory and Computer Science, Edinburgh, 1987, pp. 12-39.
28. A.M. Pitts, Non-trivial power types can't be subtypes of polymorphic types, in: 4th Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, Washington, 1989, pp. 6-13.
29. A.M. Pitts, Parametric polymorphism and operational equivalence, technical report 453, Cambridge University Computer Laboratory, 1998.
30. G. Plotkin, M. Abadi, A logic for parametric polymorphism, in: M. Bezem, J.F. Groote (Eds.), Typed Lambda Calculi and Applications, LNCS 664, Springer-Verlag, 1993, pp. 361-375.
31. G. Plotkin, M. Abadi, L. Cardelli, Subtyping and parametricity, in: 9th Annual Symposium on Logic in Computer Science, July 1994, pp. 310-319.
32. J.C. Reynolds, Towards a theory of type structure, in: B. Robinet (Ed.), Colloque sur la Programmation, LNCS 19, Springer-Verlag, 1974.
33. J.C. Reynolds, Types, abstraction, and parametric polymorphism, in: R.E.A. Mason (Ed.), Information Processing 83, North-Holland, Amsterdam, 1983, pp. 513-523.
34. J.C. Reynolds, Polymorphism is not set theoretic, in: Kahn, MacQueen, Plotkin (Eds.), Semantics of Data Types, Sophia-Antipolis, France, LNCS 173, Springer-Verlag, 1984, pp. 145-156.
35. J.C. Reynolds, Introduction to Part II: Polymorphic Lambda Calculus, in: G. Huet (Ed.), Logical Foundations of Functional Programming, Addison-Wesley, 1990.
36. J.C. Reynolds, G.D. Plotkin, On Functors Expressible in the polymorphic typed lambda calculus, in: G. Huet (Ed.), Logical Foundations of Functional Programming, Addison-Wesley, 1990, pp. 127-152.
37. C. Strachey, Fundamental concepts in programming languages, Lecture notes, International Summer School in Computer Programming, Copenhagen, August 1967. Reprinted in Higher-Order and Symbolic Computation 13(1/2) (2000) 11-49.
38. C. Strachey, Fundamental concepts in programming languages, Lecture notes, International Summer School in Computer Programming, Copenhagen, August 1967. Reprinted in Higher-Order and Symbolic Computation 13(1/2) (2000) 11-49.
39. Izumi Takeuti, An axiomatic system of parametricity, Fundamenta Informaticae, IOS Press, 33, 1998, 397-432.
40. P. Wadler, Theorems for free! in: 4th International Conference on Functional Programming Languages and Computer Architecture, ACM Press, London, 1989.
41. P. Wadler, Recursive types for free! manuscript, 1991.
42. P. Wadler, The Girard-Reynolds isomorphism, in: Kobayashi, Pierce (Eds.), Theoretical Aspects of Computer Software, LNCS 2215, Springer-Verlag, Sendai, Japan, 2001, pp. 468-491.