Applicative functors and fully transparent higher-order modules

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-01499966
Contributor : Xavier Leroy <>
Submitted on : Saturday, April 1, 2017 - 7:28:39 PM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on : Sunday, July 2, 2017 - 12:56:15 PM

File

applicative-functors.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Xavier Leroy. Applicative functors and fully transparent higher-order modules. POPL 1995: 22nd symposium Principles of Programming Languages, ACM, Jan 1995, San Francisco, United States. pp.142 - 153, ⟨10.1145/199448.199476⟩. ⟨hal-01499966⟩

Share

Metrics

Record views

250

Files downloads

132