Parametric polymorphism and operational equivalence (Preliminary Version)

Electronic Notes in Theoretical Computer Science

Volumn 10, Issue , 1998, Pages 2-27

  Pitts, Andrew M ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; ENCODING (SYMBOLS); FUNCTIONS; OBJECT ORIENTED PROGRAMMING; SEMANTICS;

DATATYPES; LOGICAL RELATIONS; METALANGUAGES; PARAMETERIC POLYMORPHISM;

COMPUTER SCIENCE;

EID: 19144369844     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80685-1     Document Type: Conference Paper

References (37)

1. Abadi M., Cardelli L., Curien P.-L. Formal parametric polymorphism. Theoretical Computer Science. 121:1993;9-58
2. Abadi M., Plotkin G.D. A per model of polymorphism and recursive types. In 5th Annual Symposium on Logic in Computer Science. 1990;355-365 IEEE Computer Society Press, Washington
3. Bainbridge E.S., Freyd P.J., Scedrov A., Scott P.J. Functorial polymorphism. Theoretical Computer Science. 70:1990;35-64. Corrigendum in 71:431
4. Birkedal L., Harper R. Relational interpretation of recursive types in an operational setting (Summary). In Proc. TACS'97, Lecture Notes in Computer Science. 1997;Springer-Verlag, Berlin. To appear
5. Böhm C., Berarducci A. Automatic synthesis of typed λ-programs on term algebras. Theoretical Computer Science. 39:1985;135-154
6. Cardelli L. Type systems. In CRC Handbook of Computer Science and Engineering, chapter 103. 1997;2208-2236
7. Coquand T., Gunter C.A., Winskel G. DI-domains as a model of polymorphism. Main M., Melton A., Mislove M., Schmidt D. Mathematical Foundations of Programming Language Semantics, volume 298 of Lecture Notes in Computer Science. April 1987;344-363 Springer-Verlag, Berlin
8. Coquand T., Gunter C.A., Winskel G. Domain theoretic models of polymorphism. Information and Computation. 81:1989;123-167
9. Felleisen M., Hieb R. The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science. 103:1992;235-271
10. Girard J.-Y. Interprétation fonctionelle et élimination des coupures dans Varithmetique d'ordre supérieur. PhD thesis, Université Paris VII. 1972;. These de doctorat d'état
11. Girard J.-Y. Proofs and Types. 1989;Cambridge University Press. Translated and with appendices by Y. Lafont., P. Taylor
12. A. D. Gordon. Operational equivalences for untyped and polymorphic object calculi. In Gordon and Pitts [13], pages 9 - 54.
13. Gordon A.D., Pitts A.M. Higher Order Operational Techniques in Semantics. Publications of the Newton Institute. 1998;Cambridge University Press
14. Harper R., Lillibridge M. Explicit polymorphism and CPS conversion. In 20th SIGPLAN-SIGACT Symposium on Principles of Programming Languages. January 1993;206-219 ACM Press
15. Harper R., Stone C. A type-theoretic account of Standard ML 1996 (version 2). Technical Report CMU-CS-96-136R. September 1996;Carnegie Mellon University, Pittsburgh, PA
16. Hasegawa R. Parametricity of extensionally collapsed term models of polymorphism and their categorical properties. Ito T., Meyer A.R. Theoretical Aspects of Computer Software, volume 526 of Lecture Notes in Computer Science. 1991;495-512 Springer-Verlag, Berlin
17. Hasegawa R. Categorical data types in parametric polymorphism. Mathematical Structures in Computer Science. 4:1994;71-110
18. S. B. Lassen. Relational reasoning about contexts. In Gordon and Pitts [13], pages 91 - 135.
19. Lassen S.B. Relational Reasoning about Functions and Nondeterminism. 1998;PhD thesis, Department of Computer Science, University of Aarhus
20. Ma Q., Reynolds J.C. Types, abstraction, and parametric polymorphism, part 2. Brookes S., Main M., Melton A., Mislove M., Schmidt D.A. Mathematical Foundations of Programming Semantics, Proceedings 1991, volume 598 of Lecture Notes in Computer Science. 1992;Springer-Verlag, Berlin
21. Mason I.A., Smith S.F., Talcott C.L. From operational semantics to domain theory. Information and Computation. 128:(1):1996;26-47
22. Mason I.A., Talcott C.L. Equivalence in functional languages with effects. Journal of Functional Programming. 1:1991;287-327
23. Morrisett G., Walker D., Crary K., Glew N. From System F to typed assembly language. In 25rd SIGPLAN-SIGACT Symposium on Principles of Programming Languages. January 1998;ACM Press. ?-?
24. Pitts A.M. Operationally-based theories of program equivalence. Dybjer P., Pitts A.M. Semantics and Logics of Computation of the Newton Institute. 1997;241-298 Cambridge University Press
25. A. M. Pitts. Reasoning about local variables with operationally-based logical relations. In P. W. O'Hearn and R. D. Tennent, editors, Algol-Like Languages, volume 2, chapter 17, pages 173 - 193. Birkhauser, 1997.
26. First appeared in Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, Brunswick, NJ, July 1996, pp 152 - 163.
27. A. M. Pitts and I. D. B. Stark. Operational reasoning for functions with local state. In Gordon and Pitts [13], pages 227 - 273.
28. Plotkin G.D. Lambda-definability and logical relations. Memorandum SAI-RM-4, School of Artificial Intelligence, University of Edinburgh. October 1973
29. Plotkin G.D. LCF considered as a programming language. Theoretical Computer Science. 5:1977;223-255
30. Plotkin G.D. Second order type theory and recursion. Notes for a talk at the Scott Fest. February 1993
31. Plotkin G.D., Abadi M. A logic for parametric polymorphism. Bezem M., Groote J.F. Typed Lambda Calculus and Applications, volume 664 of Lecture Notes in Computer Science. 1993;361-375 Springer-Verlag
32. Plotkin G.D., Abadi M., Cardelli L. Subtyping and parametricity. In 9th Annual Symposium on Logic in Computer Science. 1994;310-319 IEEE Computer Society Press, Washington
33. Reynolds J.C. Towards a theory of type structure. In Paris Colloquium on Programming, volume 19 of Lecture Notes in Computer Science. 1974;408-425 Springer-Verlag, Berlin
34. Reynolds J.C. Types, abstraction and parametric polymorphism. Mason R.E.A. Information Processing 83. 1983;513-523 North-Holland, Amsterdam
35. Reynolds J.C., Plotkin G.D. On functors expressible in the polymorphic typed lambda calculus. Information and Computation. 105:1993;1-29
36. P. Wadler. Theorems for free! In Fourth International Conference on Functional Programming Languages and Computer Architecture, London, UK, September 1989.
37. Wells J.B. Typability and type-checking in the second-order λ-calculus are equivalent and undecidable. In Proceedings, 9th Annual IEEE Symposium on Logic in Computer Science. 1994;176-185 IEEE Computer Society Press, Paris, France