PhD defence of Vincent Atassi
Tuesday 2 December 2008
Soft logic for PSPACE
M. Gaboardi, 13:30
lundi 7 juillet 2008
A PTIME functional language (discussion)
P. Baillot, M. Gaboardi, V. Mogbil
lundi 23 juin 2008
’Habilitation à diriger les recherches’
P. Baillot
Tuesday 11 March 2008
Workshop on ICC
11-12-13 february 2008
lundi 11 février 2008
Project meeting
Monday 28 January 2008
Project meeting
lundi 14 janvier 2008
Parallel time and Quantifier prefixes
by Paulin Jacobé de Naurois (joint work with Felipe Cucker)
Monday 10 December 2007
A charaterization of PSPACE (work of Gaboardi et al.)
Patrick Baillot, 13:45, B311
mardi 20 novembre 2007
NOCoST project meeting
13:30
Monday 22 October 2007
Size-change Termination and Bound Analysis
by James Avery (DIKU, University of Copenhagen), 15:00
Monday 16 July 2007
Linear logic with levels and elementary and polynomial time complexity
by Damiano Mazza, 14:00.
Monday 25 June 2007
Light Logics and Optimal Reduction: Completeness and Complexity.
by Ugo Dal Lago (joint work with P.Baillot and P.Coppola), 14:00
Monday 18 June 2007
Correctness of multiplicative (and exponential) proof structures in NL-complete
by Paulin Jacobé de Naurois & Virgile Mogbil, monday 11/6/07
Monday 11 June 2007
A type inference algorithm for the Soft Type Assignment.
Marco Gaboardi (Turin), 15h, 26/4/2007, B311 (joint work with Ronchi Della Rocca, Roversi)
Thursday 26 April 2007
Term graph rewriting, lambda calculus and cost models (work in progress).
by Ugo Dal Lago.
Monday 5 March 2007
Extending Light linear logic proof-nets.
by Damiano Mazza, monday 26/2/2007, 13:30
lundi 26 février 2007
Complexity of the correctness criterion of multiplicative linear logic proof-nets.
by P. Jacobé de Naurois and V. Mogbil, monday 19/02/07, 13:30
Monday 19 February 2007
Project meeting (NOCoST).
monday 05/02/2007, 13:30.
Monday 5 February 2007
Construire de nouveaux modèles de la logique linéaire (2)
by Daniel de Carvalho
Monday 29 January 2007
Construire de nouveaux modèles de la Logique linéaire
by Daniel De Carvalho
Monday 22 January 2007
Discussion: correctness criteria for proof-nets
by Virgile Mogbil
Monday 8 January 2007
The flow of data and the complexity of algorithms (article of Jones and Kristiansen).
by Jean-Yves Moyen
Monday 11 December 2006
On Quasi-Interpretations, Blind Abstractions and Implicit Computational Complexity
P. Baillot ( collaboration with U. Dal Lago and J.-Y. Moyen)
Monday 4 December 2006
Initiation to geometry of interaction (2)
Damiano Mazza
Monday 6 November 2006
Initiation to geometry of interaction
Damiano Mazza
Monday 23 October 2006
Resources control graphs
Jean-Yves Moyen
Monday 9 October 2006
Discussion: game semantics
by Olivier Laurent
Monday 25 September 2006
A logical analysis of some theorems in computational complexity theory.
by Kazushige Terui (NII)
Monday 18 September 2006
Proof-nets and boolean circuits (Master thesis)
Vincent Rahli
Monday 11 September 2006
Quantum data and Classical Control: Proposals and Problems
by Ugo Dal Lago
Monday 4 September 2006
An embedding of the BSS model of computation in Light Affine Lambda-Calculus
by Patrick Baillot (joint work with Marco Pedicini)
Monday 19 June 2006
Elementary type assignment system for call-by-value lambda calculus
by Paolo Coppola
Monday 12 June 2006
Context semantics, linear logic and computational complexity
Ugo Dal Lago
Monday 22 May 2006
MLL Normalization and Transitive Closure: Circuits, Complexity and Euler Tours
by Harry Mairson
Wednesday 17 May 2006
Proofs nets and boolean circuits (K. Terui)
a presentation by Vincent Rahli
Monday 24 April 2006
Discussion about Slot Games (article of D.Ghica)
P.Baillot, lundi 3/4/2006
Monday 3 April 2006
Enrichment of Non-Size Increasing with Polynomials (discussion)
Jean-Baptiste Bianquis
Monday 23 January 2006
Resources control graphs
by Jean-Yves Moyen
Monday 16 January 2006
A space measurment for computation on reals (BSS)
by Paulin Jacobé de Naurois, 13H30 room B311
Monday 9 January 2006
Cliques obsessionnelles : caractérisations sémantiques de la complexité en temps
par Olivier Laurent (PPS), 12H salle B311.
Tuesday 13 December 2005
Sémantiques non uniformes du lambda-calcul, types avec intersection et temps de calcul
par Daniel de Carvalho (IML), 11H salle B311.
Tuesday 13 December 2005
La sémantique relationnelle de la logique linéaire
induit des sémantiques du lambda-calcul pur. Celles-ci sont construites sur des
types avec intersection non idempotents. Or la taille de ces dérivations est
reliée au temps d’exécution des lambda-termes dans la machine de
Krivine.
Murawski-Ong’s game model for Light Linear Logic
by Pierre Boudes
Monday 5 December 2005
Inférence en logique linéaire élémentaire avec coercitions, par sous-typage
par Vincent Atassi
Monday 28 November 2005
Scientific discussion (NO CoST project)
room C306
Tuesday 15 November 2005
Petri-nets...
Jean-Yves Moyen
Monday 7 November 2005
Coherence spaces
Pierre Boudes
Monday 31 October 2005
BSS and space complexity
Paulin Jacobé de Naurois
Monday 24 October 2005
Non Size Increasing — Episode 2: the attack of the clones
Jean-Yves Moyen
Monday 17 October 2005
(french)
Où l’on verra deux caractérisations "alternatives" des programmes NSI. L’une
à base de quasi-interprétations et l’autre utilisant des réseaux de Petri.
Des liens avec l’espace linéaire ou logarithmique seront aussi esquissés.
Linear types and non size increasing (according to M. Hofmann)
Jean-Baptiste Bianquis
Monday 10 October 2005
Blum, Shub, Smale model of computation: relation between algebraic complexity and implicit complexity
Paulin Jacobé de Naurois
Monday 3 October 2005
Complexity analysis (and programs transformation)
Jean-Yves Moyen
Monday 26 September 2005
Slides
Game semantics
Pierre Boudes
Monday 19 September 2005
Linear logic and complexity (introduction)
Patrick Baillot
Monday 12 September 2005
Type’s inference in elementary linear logic (master’s thesis)
Vincent Atassi
Monday 5 September 2005
