#### Filter Results:

#### Publication Year

2004

2012

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

In the standard sequent presentations of Girard's Linear Logic [10] (LL), there are two " non-decreasing " rules, where the premises are not smaller than the conclusion, namely the cut and the contraction rules. It is a universal concern to eliminate the cut rule. We show that, using an admissible modification of the tensor rule, contractions can be… (More)

In the power generation industry, digital control systems may play an important role in plant safety. Thus, these systems are the object of rigorous analyzes and safety assessments. In particular, the quality , correctness and dependability of control systems software need to be justified. This paper reports on the development of a tool-based methodology to… (More)

As an attempt to uncover the topological nature of composition of strategies in game semantics, we present a " topological " game for Multiplicative Additive Linear Logic without propositional variables , including cut moves. We recast the notion of (winning) strategy and the question of cut elimination in this context, and prove a cut elimination theorem.… (More)

Game semantics is concerned with providing game models to programming languages or proof theories. Despite their success in defining fully abstract denotational semantics, game models lack count many variants, whose interrelationships largely remain to be elucidated. This raises the question: what is a game model? This paper defines an abstract notion of… (More)

We define a naive game for cut-free multiplicative additive linear logic with constants (but without variables). In this game two players fight for proving a formula respectively its linear negation. If the formula has a proof, the player has a winning strategy. A position in our game roughly consists of a single set of formulas arranged by the two players… (More)

As an attempt to uncover the topological nature of composition of strategies in game semantics, we present a " topological " game for Multiplicative Additive Linear Logic without propositional variables , including cut moves. We recast the notion of (winning) strategy and the question of cut elimination in this context, and prove a cut elimination theorem.… (More)

- ‹
- 1
- ›