![Category theory / Functional programming / Algebras / Boolean algebra / F-algebra / Functor / Algebraic structure / Ordinal number / F-coalgebra / Adjoint functors / Constructible universe / Free algebra Category theory / Functional programming / Algebras / Boolean algebra / F-algebra / Functor / Algebraic structure / Ordinal number / F-coalgebra / Adjoint functors / Constructible universe / Free algebra](https://www.pdfsearch.io/img/93d78368b7c03db0d6cbd99ba3489a5d.jpg) Date: 2009-02-12 12:52:32Category theory Functional programming Algebras Boolean algebra F-algebra Functor Algebraic structure Ordinal number F-coalgebra Adjoint functors Constructible universe Free algebra | | Towards a Unified Treatment of Induction, I: The General Recursion Theorem Paul Taylor 1995–6 Abstract The recursive construction of a function f : A → Θ consists, paradigmatically, of findingAdd to Reading ListSource URL: www.paultaylor.euDownload Document from Source Website File Size: 348,88 KBShare Document on Facebook
|