Voir la notice de l'article provenant de la source Numdam
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.
@article{ITA_2013__47_1_111_0,
author = {Vaux, Lionel},
title = {A non-uniform finitary relational semantics of system $T$},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {111--132},
publisher = {EDP-Sciences},
volume = {47},
number = {1},
year = {2013},
doi = {10.1051/ita/2012031},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.1051/ita/2012031/}
}
TY - JOUR AU - Vaux, Lionel TI - A non-uniform finitary relational semantics of system $T$ JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2013 SP - 111 EP - 132 VL - 47 IS - 1 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ita/2012031/ DO - 10.1051/ita/2012031 LA - en ID - ITA_2013__47_1_111_0 ER -
%0 Journal Article %A Vaux, Lionel %T A non-uniform finitary relational semantics of system $T$ %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2013 %P 111-132 %V 47 %N 1 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ita/2012031/ %R 10.1051/ita/2012031 %G en %F ITA_2013__47_1_111_0
Vaux, Lionel. A non-uniform finitary relational semantics of system $T$. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 47 (2013) no. 1, pp. 111-132. doi: 10.1051/ita/2012031
Cité par Sources :