2 citations · 4 across the 6 of their papers we have counts for
7 papers
The exponential logic of sequentialization
Aurore Alcolei, Luc Pellissier, Alexis Saurin
Linear logic has provided new perspectives on proof-theory, denotational semantics and the study of programming languages. One of its main successes are proof-nets, canonical repre…
Towards the convergent therapeutic potential of GPCRs in autism spectrum disorders
Anil Annamneedi, Caroline Gora, Ana Dudas +4
Changes in genetic and/or environmental factors to developing neural circuits and subsequent synaptic functions are known to be a causative underlying the varied socio-emotional be…
Gluing resource proof-structures: inhabitation and inverting the Taylor expansion
Giulio Guerrieri, Luc Pellissier, Lorenzo Tortora de Falco
A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be expanded into a set of resource proof-structures: its Taylor expansion. We introduce a new criterion charact…
Lower bounds for algebraic machines, semantically
Luc Pellissier, Thomas Seiller
This paper presents a new semantic method for proving lower bounds in computational complexity. We use it to prove that maxflow, a PTIME complete problem, is not computable in poly…
Glueability of resource proof-structures: inverting the Taylor expansion (long version)
Giulio Guerrieri, Luc Pellissier, Lorenzo Tortora de Falco
A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be expanded into a set of resource proof-structures: its Taylor expansion. We introduce a new criterion charact…
Unifying lower bounds for algebraic machines, semantically
Thomas Seiller, Luc Pellissier, Ulysse Léchine
This paper presents a new abstract method for proving lower bounds in computational complexity. Based on the notion of topological and measurable entropy for dynamical systems, it…
Relational type-checking for MELL proof-structures. Part 1: Multiplicatives
Giulio Guerrieri, Luc Pellissier, Lorenzo Tortora de Falco
Relational semantics for linear logic is a form of non-idempotent intersection type system, from which several informations on the execution of a proof-structure can be recovered.…