A deep dive into codata, dependent types, and defunctionalization—reframing the expression problem through data–codata duality.

A formal study shows de- and refunctionalization preserve typing and program well-formedness in a dependently typed language.

A formal core calculus for dependent data and codata with pattern matching, copatterns, call-by-value semantics, and type soundness proofs.

Exploring how defunctionalization breaks judgmental and eta equality—and the naming-based solution that preserves type safety.

A deep dive into dependently typed object-oriented programming, codata design, self-parameters, and verified interfaces.

A new calculus unifies functional and object-oriented paradigms in dependently typed languages using duality and defunctionalization.

A comprehensive guide to building robust, maintainable software. Covers 95 design principles—core OO, SOLID, reliability, package design and AI‑first practices—framed by the Design Pyramid and a...