A Formal Core for Dependent Data and Codata with Type Soundness Guarantees

This article presents a formal core calculus that integrates dependent data types, codata types, pattern matching, and copattern matching within a unified type-theoretic framework. It defines syntax, typing rules, and call-by-value operational semantics, and establishes type soundness through standard progress and preservation theorems.