ACMSE
2009
ACM
14 years 6 months ago
2009
ACM
TLCA
2009
Springer
14 years 6 months ago
2009
Springer
The straightforward elimination of union types is known to break subject reduction, and for some extensions of the lambda-calculus, to break strong normalization as well. Similarly...
TLCA
2009
Springer
14 years 6 months ago
2009
Springer
TLCA
2009
Springer
14 years 6 months ago
2009
Springer
We introduce a Game Semantics where strategies are partial orders, and composition is a generalization of the merging of orders. Building on this, to bridge between Game Semantics ...
TLCA
2009
Springer
14 years 6 months ago
2009
Springer
G¨odel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proo...
TLCA
2009
Springer
14 years 6 months ago
2009
Springer
In this paper we solve an open problem posed in our previous work on asynchronous subtyping [12], extending the method to higher-order session communication and functions. Our syst...
TLCA
2009
Springer
14 years 6 months ago
2009
Springer
Finiteness spaces constitute a categorical model of Linear Logic whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefsc...
TLCA
2009
Springer
14 years 6 months ago
2009
Springer
TLCA
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. We investigate the question of what constitutes a proof when quantifiers and multiplicative units are both present. On the technical level this paper provides two new as...
TLCA
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...