Back to Results
First PageMeta Content
Category 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 finding
Add to Reading List

Document Date: 2009-02-12 12:52:32


Open Document

File Size: 348,88 KB

Share Result on Facebook