科研之友
微信
新浪微博
Facebook
分享链接
摘要
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%26apos;s finiteness spaces.
- 出版日期2013-1
