|
|
 |
|
Vendredi 24 Janvier
| Heure: |
00:59 - 12:00 |
| Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
| Résumé: |
Proving complexity bounds in linear logic with context semantics |
| Description: |
Matthieu Perrinel First, I will present a simplified version of Ugo Dal Lago's context
semantics on proof-nets. Next, I will present abstract properties based on
context semantics which entail complexity bounds. I will use this
properties to make short proofs of strong complexity bounds for ELL and
LLL. Finally, I will sketch how we are currently using context semantics to
give new type systems characterizing Ptime and the first LL-based type
system characterizing primitive recursive functions. |
|
|
