104
click to vote
TLCA
15 years 8 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...
120
click to vote
TLCA
15 years 8 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...
121
click to vote
TLCA
15 years 8 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...
111
click to vote
TLCA
15 years 8 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 ...
|
Theoretical Computer Science