Michel Hirschowitz

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)
Le but de cette thèse est d'étudier la somme et le zéro dans deux principaux cadres : les iso-morphismes de types et la normalisation de λ-termes. Les isomorphismes de type avaient déjà été étudiés dans le cadre du λ-calcul simplement typé avec paires surjectives mais sans somme. Pour aborder le cas avec somme et zéro, j'ai commencé par restreindre l'étude(More)
  • 1