%0 Journal Article
%T A non-uniform finitary relational semantics of System T
%+ Institut de mathématiques de Luminy (IML)
%A Vaux, Lionel
%< avec comité de lecture
%@ 0988-3754
%J RAIRO - Theoretical Informatics and Applications (RAIRO: ITA)
%I EDP Sciences
%S 6th Workshop on Fixed Points in Computer Science (FICS'09)
%V 47
%N 1
%P 111 - 132
%8 2013
%D 2013
%R 10.1051/ita/2012031
%K higher order primitive recursion
%K denotational semantics
%Z MSC: 03B70 / 03D65 / 68Q55
%Z Computer Science [cs]/Logic in Computer Science [cs.LO]
%Z Mathematics [math]/Logic [math.LO]Journal articles
%X 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.
%G English
%2 https://hal.science/hal-01264669/document
%2 https://hal.science/hal-01264669/file/rel-T-extended.pdf
%L hal-01264669
%U https://hal.science/hal-01264669
%~ CNRS
%~ UNIV-AMU
%~ INSMI
%~ IML
%~ I2M
%~ ANR