Representation independence and data abstraction (preliminary version)

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 1986, Pages 263-276

  Mitchell, John C ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER PROGRAMMING LANGUAGES; DIFFERENTIATION (CALCULUS); OBJECT ORIENTED PROGRAMMING;

DATA ABSTRACTION; FUNCTION PARAMETERS; FUNCTIONAL LANGUAGES; INDEPENDENCE PROPERTIES; LAMBDA CALCULUS; POLYMORPHIC FUNCTIONS; SECOND ORDERS; USER-DEFINED TYPES;

ABSTRACT DATA TYPES;

EID: 85051039925     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/512644.512669     Document Type: Conference Paper

References (22)

1. Bruce, K. And Meyer, A., A Completeness Theorem for Second-Order Polymorphic Lambda Calculus. In Proc. Int. Symp. On Semantics of Data Types, Sophia-Antipolis (France), 1984, pages 131-144.
2. Bruce, K.B., Meyer, A.R. And Mitchell, J.C., The semantics of second-order lambda calculus. To appear
3. Burstali, R. And Lampson, B., A Kernel Language for Abstract Data Types and Modules. In Proc. M'l Symp. On Semantics of Data Types, 1984, pages 1-50.
4. Donahue, }., On the semantics of data type. SIAM J. Computing 8 1979. Pages 546-560
5. Friedman, H., Equality Between Junctionals. In R. Parikh (ed.), Logic Colloquium, pages 22-37. Springer-Verlag 1975.
6. Girard, J.-Y., Une extension i.? L'interprétation de Godei a l'analyse, et son application a lamination des coupures dans l'analyse se la théorie des types. In Fenstad, J.E, (ed.), 2nd Scandinavian Logic Symp., pages 63-92. North-Holland 1971.
7. Gordon, M.J., R. Miner and CP. Wadsworth, Edinburgh LCF. Lecture Notes in Computer Science, Vol. 78 Springer-Verlag 1979.
8. Hayn es, CT., A Theory of Data Type Representation Independence. In Inf. Symp. On Semantics of Data Types, Springer-Verlag, 1984, pages 157-176.
9. Liskov, B. Et. Al, CLU Reference Manual. Lecture Notes in Computer Science, Vol. 114 Springer-Verlag 1981.
10. MacQueen, D.B., Modules for Standard ML. Polymorphism 2, 2 1985, 35 pages. An earlier version appeared in Proc. I984 ACM Symp. On Lisp and Functional Programming.
11. MacQueen, D.B., Using dependent types to express modular structure. In Proc. 13-th ACM Symp, on Principles of Programming Languages, 1986. To appear.
12. Martin-Löf, P., Constructive mathematics and computer programming. 1979. Paper presented at 6 International Congress for Logic, Methodology and Philosophy of Science, Preprint, Univ. Of Stockholm, Dept. Of Math. 1979
13. McCracken, N., An Investigation of a Programming Language with a Polymorphic Type Structure, Syracuse Univ. 1979.
14. Milner, R., The standard ML core language. Polymorphem 2, 2 1985. 28 pages. An earlier version appeared in Proc. 1984 ACM Symp. On Lisp and Functional Programming.
15. Mitchell, J.C., Semantic models for second-order lambda calculus. In Pro;. 25-th IEEE Symp. On Foundations of Computer Science, 1984, pages 289-299.
16. Mitchell, J.C. And Plotkin, G.D., Abstract types have existential types. In Proc. 12-th ACM Symp. On Principles of Programming Languages, January, 1985. Pp. 37-51.
17. Mitchell, J.C. And Meyer, A.R., Second-order logical relations. In Logics of Programs, June, 1985. Pages 225-236.
18. Plotkin, G.D., Lambda definability in the full type hierarchy. In To H.B. Curry; Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 363-373. Academic Press 1980.
19. Reynolds, J.C, Towards a Theory of Type Structure. In Paris Colloq. On Programming, Springer-Verlag, 1974, pages 408-425.
20. Reynolds, J.C, Types, Abstraction, and Parametric Polymorphism. In IFIP Congress, 1983.
21. Statman, R. Logical relations and the typed lambda calculus. (Manuscript.) To appear in Information and Control
22. Tait, W.W., Intensional interpretation of functionals of finite type./. Symbolic Logic 32 1967. Pages 198-212