A non-uniform finitary relational semantics of System T Auteur(s): Vaux Lionel (Article) Publié: Rairo - Theoretical Informatics And Applications (Rairo Ita), vol. 47 p.111 - 132 (2013) Ref HAL: hal-01264669_v1 DOI: 10.1051/ita/2012031 Exporter : BibTex | endNote Résumé: We study iteration and recursion operators in the denotational semantics of typed λ-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.