Parametricity and variants of Girard's J operator

Information Processing Letters

Volumn 70, Issue 1, 1999, Pages 1-5

  Harper, Robert ^a   Mitchell, John C ^b  

^a Carnegie Mellon University   (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC;

FUNCTIONAL PROGRAMMING; GIRARD'S OPERATOR; GIRARD-REYNOLDS POLYMORPHIC CALCULUS;

MATHEMATICAL OPERATORS;

EID: 0033574362     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00036-8     Document Type: Article

References (12)

1. M. Abadi, L. Cardelli, B. Pierce, G. Plotkin, Dynamic typing in a statically typed language, ACM Trans. Programming Languages Systems 13 (2) (1991) 237-268.
2. T. Coquand, An analysis of Girard's paradox, in: Proc. IEEE Symp. on Logic in Computer Science, June 1986, pp. 227-236.
3. T. Coquand, H. Herbelin, A-translation and looping combinators in pure type systems, J. Functional Programming 4 (1) (1994) 77-88.
4. J.-Y. Girard, Une extension de l'interpretation de Gödel à l'analyse, et son application à l'élimination des coupures dans l'analyse et la théorie des types, in: J.E. Fenstad (Ed.), 2nd Scandinavian Logic Symposium, North-Holland, Amsterdam, 1971, pp. 63-92.
5. J.-Y. Girard, Interpretation fonctionelle et elimination des coupures de l'arithmetique d'ordre superieur, These D'Etat, Universite Paris VII, 1972.
6. R. Harper, G. Morrisett, Compiling polymorphism using intensional type analysis, in: Proc. 22nd ACM Symp. on Principles of Programming Languages, San Francisco, CA, January 1995, pp. 130-141.
7. W. Howard, The formulas-as-types notion of construction, in: To H.B. Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism, Academic Press, 1980, pp. 479-490.
8. A.R. Meyer, M.B. Reinhold, Type is not a type, in: Proc. 13th ACM Symp. on Principles of Programming Languages, January 1986, pp. 287-295.
9. E. Palmgren, On universes in type theory, in: G. Sambin, J. Smith (Eds.), Twenty-Five Years of Constructive Type Theory, Oxford Logic Guides, Oxford University Press, Oxford, England, 1998.
10. J.C. Reynolds, Towards a theory of type structure, in: Paris Colloq. on Programming, Lecture Notes in Computer Sci., Vol. 19, Springer, Berlin, 1974, pp. 408-425.
11. J.C. Reynolds, Types, abstraction, and parametric polymorphism, in: Information Processing '83, North-Holland, Amsterdam, 1983, pp. 513-523.
12. A.S. Troelstra, Mathematical Investigation of Intuitionistic Arithmetic and Analysis, Lecture Notes in Math., Vol. 344, Springer, Berlin, 1973.