Formalizing Recursive Modules

This is the project dashboard for the INRIA / Didier Rémy Recursive Modules thread: OCaml recursive modules elaborated into an Mω / Fωμ-style target with equi-recursive types. Keep this separate from ISO-recursive Subtyping / weakly-positive subtyping.

Current focus

Active todos

  • Write Section 6 Related Work.
  • Work out the source-to-source translation after Double Vision §4.4.
  • Resolve and present the two Double Vision modes.
  • Push recursive signature ^ww75 toward paper-ready formalization.
  • Decide paper stance on head(π) ∉ fv(τ′) and k_equiv.
  • Collect examples/proofs for lookup double vision and Opaque fallback.
  • Follow up on Didier’s ZipML higher-kind check.

Paper and writing

Meetings

Mechanization / Fωμ

  • Fomega-rec formalization
  • Working logs live under Mechanization/Fomega-rec Formalization/Working Logs/.
  • Treat this track as supporting material for the writing, not as the immediate main bottleneck.

Core technical notes

Literature / background

Older project notes