No CrossRef data available.
Article contents
A non-uniform finitary relational semantics of system T∗
Published online by Cambridge University Press: 10 January 2013
Abstract
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.
- Type
- Research Article
- Information
- RAIRO - Theoretical Informatics and Applications , Volume 47 , Issue 1: 6th Workshop on Fixed Points in Computer Science (FICS'09) , January 2013 , pp. 111 - 132
- Copyright
- © EDP Sciences 2013