Generativity and Dynamic Opacity for Abstract Types

Proceedings of the ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn 5, Issue , 2003, Pages 241-252

  Rossberg, Andreas ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

Abstract types; Dynamic typing; Encapsulation; Existential types; Generativity; Opacity

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CRYPTOGRAPHY; FUNCTIONS; OPACITY; SEMANTICS; SGML;

ABSTRACT TYPES; DYNAMIC TYPING; EXISTENTIAL TYPES; GENERATIVITY;

ABSTRACTING;

EID: 1242287791     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/888251.888274     Document Type: Conference Paper

References (34)

1. M. Abadi, L. Cardelli, B. Pierce, and D. Rémy. Dynamic typing in polymorphic languages. Journal of Functional Programming, 5(1):111-130, Jan. 1995.
2. Alice Team. The Alice System. Programming System Lab, Universität des Saarlandes, http://www.ps.un-sb.de/alice/, 2003.
3. H. Barendregt. Lambda calculi with types. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, chapter 2, pages 117-309. Oxford University Press, 1992.
4. L. Cardelli, J. Donahue, L. Glassman, M. Jordan, B. Kalsow, and G. Nelson. Modula-3 language definition. In G. Nelson, editor, System Programming with Modula-3, chapter 2, pages 11-66. Prentice Hall, 1991.
5. L. Cardelli and X. Leroy. Abstract types and the dot notation. In IFIP TC2 working conference on programming concepts and methods, pages 479-504. North-Holland, Mar. 1990.
6. D. Dreyer, K. Crary, and R. Harper. A type system for higher-order modules. In 30th Symposium on Principles of Programming Languages, New Orleans, USA, Jan. 2003.
7. C. Dubois, F. Rouaix, and P. Weis. Extensional polymorphism. In 22nd Symposium on Principles of Programming Languages, San Francisco, USA, Jan. 1995.
8. J.-Y. Girard. Interprétation Fonctionnelle et Élimination des Coupures de l'Arithmétique d'Ordre Supérieur. PhD thesis, June 1972.
9. N. Glew. Type dispatch for named hierarchical types. In International Conference on Functional Programming, Paris, France, Oct. 1999.
10. D. Grossman, G. Morrisett, and S. Zdancewic. Syntactic type abstraction. Transactions on Programming Languages and Systems, 22(6):1037-1080, Nov. 2000.
11. R. Harper and G. Morrisett. Compiling polymorphism using intensional type analysis. In 22nd Symposium on Principles of Programming Languages, pages 130-141, San Francisco, USA, Jan. 1995.
12. X. Leroy. Applicative functors and fully transparent higher-order modules. In 22nd Symposium on Principles of Programming Languages, pages 142-153, San Francisco, USA, Jan. 1995. ACM.
13. X. Leroy. The Objective Caml System. INRIA, 2003. http://pauillac.inria.rr/ocaml/htmlman/.
14. X. Leroy and M. Mauny. Dynamics in ML. Journal of Functional Programming, 3(4):431-463, 1993.
15. M. Lillibridge. Translucent Sums: A Foundation for Higher-Order Module Systems. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, USA, May 1997.
16. B. Liskov, R. Atkinson, T. Bloom, E. Moss, C. Schaffert, R. Scheifler, and A. Snyder. CLU reference manual. Technical Report MIT/LCS/TR-225, 1979.
17. R. Milner, M. Tofte, R. Harper, and D. MacQueen. Definition of Standard ML (Revised). The MIT Press, 1997.
18. J. Mitchell. On the equivalence of data representations. In V. Lifschitz, editor, Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, pages 305-330. Academic Press, 1991.
19. J. Mitchell and G. Plotkin. Abstract types have existential type. Transactions on Programming Languages and Systems, 10(3):470-502, 1988. Preliminary version appeared in 12th Symposium on Principles of Programming Languages, 1985.
20. B. Pierce. Types and Programming Languages. The MIT Press, Feb. 2002.
21. B. Pierce and E. Sumii. Relating cryptography and polymorphism. Technical report, July 2000. http://www.yl.is.s.u-tokyo.ac.jp/̃sumii/pub/.
22. A. Pitts. Existential types: Logical relations and operational equivalence. In 25th International Colloquium on Automata, Languages and Programming, volume 1443 of Lecture Notes in Computer Science, pages 309-326. Springer-Verlag, Berlin, 1998.
23. A. Pitts. Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science, 10:321-359, 2000.
24. A. Pitts and I. Stark. On the observable properties of higher order functions that dynamically create local names. In P. Hudak, editor, Workshop on State in Programming Languages, pages 31-45, Copenhagen, Denmark, 1993.
25. G. Plotkin and M. Abadi. A logic for parametric polymorphism. In M. Beeze and J. F. Groote, editors, Typed Lambda Calculus and Applications, volume 664 of Lecture Notes in Computer Science, pages 361-375. Springer-Verlag, Berlin, 1993.
26. J. Reynolds. Types, abstraction and parametric polymorphism. In R. Mason, editor, Information Processing, pages 513-523, Amsterdam, 1983. North Holland.
27. C. Russo, Types for Modules. Dissertation, University of Edinburgh, 1998.
28. D. Sangiorgi and D. Walker. The π-calculus: a Theory of Mobile Processes. Cambridge University Press, Dec. 2001.
29. P. Sewell. Modules, abstract types, and distributed versioning. In 28th Symposium on Principles of Programming Languages, London, UK, Jan. 2001.
30. C. Strachey. Fundamental concepts in programming languages. In Lecture Notes, International Summer School in Computer Programming. Copenhagen, Aug. 1967. Reprinted in: Higher-Order and Symbolic Computation, 13(1-2):11-49, April 2000.
31. C. Strachey. Fundamental concepts in programming languages. In Lecture Notes, International Summer School in Computer Programming. Copenhagen, Aug. 1967. Reprinted in: Higher-Order and Symbolic Computation, 13(1-2):11-49, April 2000.
32. V. Trifonov, B. Saha, and Z. Shao. Fully reflexive intensional type analysis. In Fifth International Conference on Functional Programming, pages 82-93, Montreal, Canada, Sept. 2000.
33. S. Weirich. Type-safe cast. In International Conference on Functional Programming, pages 58-67, Montreal, Canada, Sept. 2000.
34. N. Wirth. Programming in MODULA-2. Springer-Verlag, 3rd edition, 1985.