ABSTRACT
We propose F-zip, a calculus of open existential types that is an extension of System F obtained by decomposing the introduction and elimination of existential types into more atomic constructs. Open existential types model modular type abstraction as done in module systems. The static semantics of F-zip adapts standard techniques to deal with linearity of typing contexts, its dynamic semantics is a small-step reduction semantics that performs extrusion of type abstraction as needed during reduction, and the two are related by subject reduction and progress lemmas. Applying the Curry-Howard isomorphism, F-zip can be also read back as a logic with the same expressive power as second-order logic but with more modular ways of assembling partial proofs. We also extend the core calculus to handle the double vision problem as well as type-level and term-level recursion. The resulting language turns out to be a new formalization of (a minor variant of) Dreyer's internal language for recursive and mixin modules.
- Luca Cardelli and Xavier Leroy. Abstract types and the dot notation. In M. Broy and C. B. Jones, editors, Proceedings IFIP TC2 working conference on programming concepts and methods, pages 479--504. North-Holland, 1990.Google Scholar
- Derek Dreyer. Recursive type generativity. Journal of Functional Programming, pages 433--471, 2007. Google Scholar
Digital Library
- Derek Dreyer. A type system for recursive modules. In Proceedings of ACM SIGPLAN International Conference on Functional Programming, pages 289--302, 2007. Google Scholar
Digital Library
- Derek Dreyer, Karl Crary, and Robert Harper. A type system for higher-order modules. In Proceedings of ACM SIGPLAN Symposium on Principles of Programming Languages, pages 236--249, 2003. Google Scholar
Digital Library
- Matthew Flatt and Matthias Felleisen. Units: Cool modules for hot languages. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 236--248, 1998. Google Scholar
Digital Library
- Robert Harper and Mark Lillibridge. A type-theoretic approach to higher-order modules with sharing. In Proceedings of ACM SIGPLAN Symposium on Principles of Programming Languages, pages 123--137, New York, NY, USA, 1994. ACM. Google Scholar
Digital Library
- Robert Harper, John C. Mitchell, and Eugenio Moggi. Higher-order modules and the phase distinction. In Proceedings of ACM SIGPLAN Symposium on Principles of Programming Languages, pages 341--354, San Francisco, CA, January 1990. Google Scholar
Digital Library
- Robert Harper and Benjamin C. Pierce. Design considerations for ML-style module systems. In Benjamin C. Pierce, editor, Advanced Topics in Types and Programming Languages, chapter 8, pages 293--345. The MIT Press, 2005.Google Scholar
- Daniel K. Lee, Karl Crary, and Robert Harper. Towards a mechanized metatheory of Standard ML. SIGPLAN Not., 42(1):173--184, 2007. Google Scholar
Digital Library
- A syntactic theory of type generativity and sharing. Journal of Functional Programming, 6(5):667--698, 1996.Google Scholar
Cross Ref
- Xavier Leroy, Damien Doligez, Jacques Garrigue, Didier Remy, and Jerome Vouillon. The Objective Caml system release 3.10. INRIA, May 2007.Google Scholar
- David MacQueen. Modules for Standard ML. In ACM Symposium on LISP and functional programming, pages 198--207, New York, NY, USA, 1984. ACM. Google Scholar
Digital Library
- Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The Definition of Standard ML (Revised). The MIT Press, May 1997. Google Scholar
Digital Library
- John C. Mitchell and Gordon D. Plotkin. Abstract types have existential type. ACM Trans. Program. Lang. Syst., 10(3):470--502, 1988. Google Scholar
Digital Library
- Benoit Montagu and Didier Remy. Towards a simpler account of modules and generativity: Abstract types have Open existential types. Available at http://gallium.inria.fr/remy/modules/, March 2008.Google Scholar
- Martin Odersky, Vincent Cremet, Christine Rockl, and Matthias Zenger. A nominal theory of objects with dependent types. In Proceedings of European Conference on Object-Oriented Programming, pages 201--224, 2003.Google Scholar
Cross Ref
- Gilles Peskine. Abstract types in collaborative programs. PhD thesis, Universite Paris VII -- Denis Diderot, June 2008.Google Scholar
- John C. Reynolds. Types, abstraction and parametric polymorphism. In Information Processing 83, pages 513--523. Elsevier Science, 1983.Google Scholar
- Sergei Romanenko, Claudio Russo, and Peter Sestoft. Moscow ML Owner's Manual, June 2000.Google Scholar
- Andreas Rossberg. Generativity and dynamic opacity for abstract types. In Proceedings of ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, pages 241--252, Uppsala, Sweden, September 2003. Google Scholar
Digital Library
- Claudio V. Russo. Types for modules. Electronic Notes in Theoretical Computer Science, 60, January 2003.Google Scholar
- Christopher A. Stone and Robert Harper. Deciding type equivalence in a language with singleton kinds. In Proceedings of ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, pages 214--227, Boston, January 2000. Google Scholar
Digital Library
- Andrew K. Wright and Matthias Felleisen. A syntactic approach to type soundness. Information and Computation, 115(1):38--94, 1994. Google Scholar
Digital Library
Index Terms
Modeling abstract types in modules with open existential types
Recommendations
Modeling abstract types in modules with open existential types
POPL '09We propose F-zip, a calculus of open existential types that is an extension of System F obtained by decomposing the introduction and elimination of existential types into more atomic constructs. Open existential types model modular type abstraction as ...
Generativity and dynamic opacity for abstract types
PPDP '03: Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programmingThe standard formalism for explaining abstract types is existential quantification. While it provides a sufficient model for type abstraction in entirely statically typed languages, it proves to be too weak for languages enriched with forms of dynamic ...
Dynamic Translucency with Abstraction Kinds and Higher-Order Coercions
When a module language is combined with forms of non-parametric type analysis, abstract types require an opaque dynamic representation in order to maintain abstraction safety. As an idealisation of such a module language, we present a foundational ...







Comments