ToposInstitute / polytt

A type theory with native support for Polynomial Functors.
38 stars 3 forks source link

Free / Co-Free #11

Open solomon-b opened 1 year ago

dspivak commented 1 year ago

The free monad Free p satisfies the inductive formula Free p = y + (p \tri (Free p)) and the cofree comonad Cofree p satisfies the coinductive formula Cofree p = y x (p \tri (Cofree p)). Is this enough to define them in the type theory?