A logic for parametric polymorphism

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

Volumn 664 LNCS, Issue , 1993, Pages 361-375

  Plotkin, Gordon ^a   Abadi, Martín ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BIOMINERALIZATION; CALCULATIONS; DIFFERENTIATION (CALCULUS); PATHOLOGY; POLYMORPHISM;

CO INDUCTIONS; FORMAL PRESENTATION; INITIAL ALGEBRAS; PARAMETRIC POLYMORPHISM; PARAMETRICITY; RECURSIONS; RELATIONAL PARAMETRICITY; SIMPLY TYPED LAMBDA CALCULUS;

COMPUTER CIRCUITS;

EID: 85028748723     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0037118     Document Type: Conference Paper

References (22)

1. [ACC93] Martin Abadi, Luca Cardelli and Pierre-Louis Curies. Formal parametric polymorphism. To Appear in proceedings of Principles of Prgramming Languages '93.
2. [AM89] Peter Aczel and Nax Mendler. A final co-algebra theorem. In D. H. Pitt et al., editors, Category Theory and Computer Science Lecture Notes in Computer Science, 389:357-365 Berlin, 1989. Springer-Verlag.
3. [BFSS90] E.S. Balnhridge, Peter J. Freyd, Andre Scedrov, and Philip J. Scott. Functorial polymorphism. Theoretical Computer Science, 70(1):35-64, January 15 1990. Corrigendum in (3) 71, 10 April 1990, p. 431.
4. [Böh85] Corrado Böhm and A. Berazducci. Automatic synthesis of typed A-programs on term algebras. Theoretical Computer Science, 39:85-114, 1985.
5. [CMMS91] Luca Cardelli, Simone Martini, John Mitchell, and Andre Scedrov. An extension of system F with subtyping. In T. Ito and A. R. Meyer, editors, Theoretical Aspects of Computer Software, volume 526 of Lecture Notes in Computer Science, pages 750-770, Berlin, 1991. Springer-Verlag.
6. [CG91] Pierre-Louis Curien and Giorgio Ghelli. Subtyping + extensionality: Confluence of/βntop reduction in F≤. In T. Ito and A. R. Meyer, editors, Theoretical Aspects of Computer Software, volume 526 of Lecture Notes in Computer Science, pages 731-749, Berlin, 1991. Springer-Verlag.
7. [CG92] Pierre-Louis Curien and Giorgio Ghelli. Coherence of subsumption, minimum typing and type-checking in F≤. Mathematical Structures in Computer Science, 2(1):55-92, March 1992.
8. [Has90] Ryu Hazegawa. Categorical data types in parametric polymorphism. Mathematical Structures in Computer Science, 1990. To appear.
9. [Itaz91] Ryu Hasegawa. Parametricity of extensionally collapsed models of polymorphism and their categorical properties. In T. Ito and A. R. Meyer, editors, Theoretical Aspects of Computer Software, volume 526 of Lecture Notes in Computer Science, pages 495-512, Berlin, 1991. Springer-Verlag.
10. [MR92] QingMing Ma and John C. Reynolds. Types, abstraction, and parametric polymorphism, part 2. In S. Brookes, M. Main, A. Melton, M. Mislove, and D. A. Schmidt, editors, Proceedings of the 1991 Mathematical Foundations of Programming Semantics Conference, Lecture Notes in Computer Science, Berlin, 1992. Springer-Verlag. To appear.
11. [Mai91] Harry Mairson. Outline of a proof theory of parametricity. In Proc. 5th International Symp. on Functional Programming Languages and Computer Architecture, Springer-Verlag, 1991.
12. [MP85] John C. Mitchell and Gordon D. Plotkin. Abstract types have existential type. In Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages, pages 37-51, 1985.
13. [Mit90] John C. Mitchell. A type inference approach to reduction properties and semantics of polymorphlc expressions (summary). In G. Huet, editor, Logical Foundations of Functional Programming, pages 195-212, Reading, 1990. Addison-Wesley.
14. [Mit91] John C. Mitchell. On the equivalence of data representations. In V. Lifshitz, editor, Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, Academic Press, pages 305-330, 1991.
15. [Pit87] Andrew M. Pitts. Polymorphism is set-theoretic, constructively. In D. H. Pitt et al, editors, Category Theory and Computer Science Lecture Notes in Computer Science, 283:12-39 Berlin, 1987. Springer-Verlag.
16. [Pit92] Andrew M. Pitts. A co-induction principle for recursivdy defined domains. To appear in Theoretical Computer Science.
17. [Rey83] John C. Reynolds. Types, abstraction and parametric polymorphism. In It. E. A. Mason, editor, Information Processing 83, pages 513-523, Amsterdam, 1983. Elsevier Science Publishers B. V. (North-Holland).
18. [R, P90] John C. Reynolds and Gordon D. Plotkin. On functors expressible in the polymorphic typed lambda calculus. In G. Huet, editor, Logical Foundations of Functional Programming, pages 127-152, Reading, 1990. Addison-Wesley.
19. [Smy91] Michael B. Smyth. I-categories and duality. In M. P. Fourman, P. T. Johnstone and A. M. Pitts, Applications of Categories in Computer Science London Mathematical Society Lecture Note Series, 177:270-287, Cambridge, 1991 Cambridge University Press.
20. [Str67] Christopher Strachey. Fundamental concepts in programming languages. Lecture Notes, International Summer School in Programming Languages, Copenhagen, Unpublished, August 1967.
21. [Wad89] Philip Wadler. Kecursive types in polymorphic second-order lambda-calculus Draft, University of Glasgow 1990.
22. [Wra89] Gavin C. Wraith. A note on categorical datatypes. In A. M. Pitts and A. Poigné, editors, Category Theory and Computer Science Lecture Notes in Computer Science, 39:118-127, Berlin, 1989, Springer-Verlag.