Primitive recursive functional: Difference between revisions

Revision as of 01:12, 17 February 2021

Revision as of 02:07, 1 February 2023

Line 1:

{{confuse|Primitive recursive function}}

In [[mathematical logic]], the '''primitive recursive functionals''' are a generalization of [[primitive recursive functions]] into higher [[type theory]]. They consist of a collection of functions in all pure finite types.