Applicative functors and fully transparent higher-order modules - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1995

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.
Fichier principal
Vignette du fichier
applicative-functors.pdf (195.02 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01499966 , version 1 (01-04-2017)

Identifiers

Cite

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⟩

Collections

INRIA INRIA2
148 View
204 Download

Altmetric

Share

Gmail Facebook X LinkedIn More