6 articles
← Back to all tagsAlgebraic type theory offers us an elegant correspondence between data structures and elementary arithmetic.
A total function is one that terminates and produces a valid value for every input in its declared domain.
Embedded domain-specific languages (embedded DSLs) allow building mini-languages within a host language, inheriting its syntax, type system, and tooling.
The Curry-Howard correspondence, sometimes called the Curry-Howard isomorphism, establishes a deep equivalence between two apparently distinct domains: formal logic and type theory. The term isomorphi...
Philip Wadler, in his talk and paper "Propositions as Types," offers a historical and philosophical meditation on the Curry-Howard correspondence.
Beyond classical typing, certain systems allow encoding finer properties. The compiler then becomes a proof assistant, enabling enforcement of even more precise business invariants.