Generic Programming with Extensible Data Types: Or, Making Ad Hoc Extensible Dat...
summary
Claims a practical calculus, System Rω, that extends Fω with row types and higher‑order rows to express generic operations over unknown labels; implements label‑generic case distinction via ana/sin combinators and a branching/containment predicate algebra; builds reflect/raise functions that turn records of handlers into variant eliminators and vice versa; types a generic map and functor lifting; gives a denotational semantics and machine‑checked type‑safety proof in Agda semantics; artifacts and reusable evaluations accompany the paper.
AI-written summary · about