Xavier Leroy. Applicative functors and fully transparent higher-order modules. In POPL 1995: 22nd symposium Principles of Programming Languages, pages 142--153. ACM, 1995.

We present a variant of the Standard ML module system where parameterized abstract types (i.e. functors returning generative types) map provably equal arguments to compatible abstract types, instead of generating distinct types at each application as in Standard ML. This extension solves the full transparency problem (how to give syntactic signatures for higher-order functors that express exactly their propagation of type equations), and also provides better support for non-closed code fragments.

bib | DOI | Local copy | At publisher's site ] Back


This file was generated by bibtex2html 1.98.