Primitive recursive functional: Difference between revisions

Revision as of 14:50, 17 May 2009

Revision as of 14:52, 17 May 2009

Line 18:

The primitive recursive functionals are the smallest collection of objects of finite type such that:

* For every type The constant function ''f''(''n'') = 0 is a primitive recursive functional

* The successor function ''g''(''n'') = ''n'' + 1 is a primitive recursive functional

* For any type σ×τ, the functional K(''x''^σ, ''y''^τ) = ''x'' is a primitive recursive functional