2024/10/15 by Alex Hubers, Hubers, Alex, Apoorv Ingle +5
Computer Science · #Computability, Logic, AI Algorithms #FOS: Computer and information sciences #Programming Languages (cs.PL)
paper · pdf · doi:10.48550/arxiv.2410.11742
openalex publication_date 2024/10/15 · openalex created_date 2024/10/20 · openalex updated_date 2026/07/28
We explore recursive programming with extensible data types. Row types make the structure of data types first class, and can express a variety of type system features including record subtyping and combination of case branches. Our goal is the modular combination of recursive types and of recursive functions over them. The most significant challenge is in recursive function calls, which may need to account for new cases in a combined type. We introduce extensible histomorphisms, Mendler-style descriptions of recursive functions in which recursive calls can happen at larger types, and show that they provide expressive recursion over extensible data types. We formalize our approach in Rωμ, a row type theory with support for recursive terms and types.