A NON-UNIFORM FINITARY RELATIONAL SEMANTICS OF SYSTEM T
We study iteration and recursion operators in the denotational semantics of typed lambda-calculi derived from the multiset relational model of linear logic. Although these operators are defined as fixpoints of typed functionals, we prove them finitary in the sense of Ehrhard's finiteness spaces.
denotational semantics higher order primitive recursion