Sciweavers

Share
TLCA
2009
Springer
9 years 3 months ago
Refinement Types as Proof Irrelevance
William Lovas, Frank Pfenning
TLCA
2009
Springer
9 years 5 months ago
On the Values of Reducibility Candidates
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...
Colin Riba
TLCA
2009
Springer
9 years 5 months ago
Partial Orders, Event Structures and Linear Strategies
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 ...
Claudia Faggian, Mauro Piccolo
TLCA
2009
Springer
9 years 5 months ago
On the Meaning of Logical Completeness
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...
Michele Basaldella, Kazushige Terui
TLCA
2009
Springer
9 years 5 months ago
Session-Based Communication Optimisation for Higher-Order Mobile Processes
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...
Dimitris Mostrous, Nobuko Yoshida
TLCA
2009
Springer
9 years 5 months ago
Algebraic Totality, towards Completeness
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...
Christine Tasson
TLCA
2009
Springer
9 years 5 months ago
Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic
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...
Lutz Straßburger
books