- 14
- 2
- 1
- 1
Luc Pellissier
18
Documents
Présentation
Doctorant au LIPN, Université Paris 13, Université Sorbonne Paris Cité, sous la direction de Damiano Mazza.
[Ma page personnelle](http://lipn.univ-paris13.fr/~pellissier/)
Currently preparing a PhD at the LIPN, Université Paris 13, Université Sorbonne Paris Cité, under the supervision of Damiano Mazza.
[Ma page personnelle](http://lipn.univ-paris13.fr/~pellissier/)
Publications
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 6
- 4
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
The exponential logic of sequentializationMFPS XXXIX - 39th Conference on the Mathematical Foundations of Programming Semantics, Marie Kerjean & Paul B. Levy, Jun 2023, Bloomington (Indiana), United States. ⟨10.46298/entics.12419⟩
Communication dans un congrès
hal-04308279v1
|
|
|
MELL proof-nets in the category of graphs5th International Workshop on Trends in Linear Logic and Applications (TLLA 2021), Jun 2021, Rome (virtual), Italy
Communication dans un congrès
lirmm-03271478v1
|
|
Canonical proof-objects for coinductive programming: infinets with infinitely many cutsPPDP 2021: 23rd International Symposium on Principles and Practice of Declarative Programming, Sep 2021, Tallinn, Estonia. pp.1-15, ⟨10.1145/3479394.3479402⟩
Communication dans un congrès
hal-03371935v1
|
|
Inferential Semantics as Argumentative DialoguesDCAI 2020 - 17th International Conference on Distributed Computing and Artificial Intelligence, Jun 2020, L´Aquila, Italy. pp.72-81, ⟨10.1007/978-3-030-53829-3_7⟩
Communication dans un congrès
hal-02922646v1
|
|
Glueability of resource proof-structures: inverting the Taylor expansion28th EACSL Annual Conference on Computer Science Logic, Jan 2020, Barcelone, Spain. ⟨10.4230/LIPIcs.CSL.2020.24⟩
Communication dans un congrès
hal-02957862v1
|
|
Relational type-checking for MELL proof-structures. Part 1: MultiplicativesEighth Workshop on Intersection Types and Related Systems, Jun 2016, Porto, Portugal
Communication dans un congrès
hal-01324001v1
|
Relational type-checking of connected proof-structuresDevelopments in Implicit Computational Complexity, Apr 2016, Eindhoven, Netherlands
Communication dans un congrès
hal-01287936v1
|
|
|
Computing connected proof(-structure)s from their Taylor expansionFormal Structures in Computation and Deduction, Jun 2016, Porto, Portugal. pp.20:1-20:18
Communication dans un congrès
hal-01310563v1
|
|
A Functorial Bridge between the Infinitary Affine Lambda-Calculus and Linear LogicInternation Colloquium on Theoretical Aspects of Computing, Oct 2015, Cali, Colombia. pp.144-161, ⟨10.1007/978-3-319-25150-9_10⟩
Communication dans un congrès
hal-01183520v2
|
Injectivity of relational semantics with respect to MELL proof-nets and the Taylor expansion8th International Conference on Topology, Algebra and Categories in Logic, Jun 2015, Ischia, Italy
Communication dans un congrès
hal-01298563v1
|
|
|
Monetary Economics Simulation: Stock-Flow Consistent Invariance, Monadic Style11th Artificial Economics Conference, Faculdade de Economia do Porto, Sep 2015, Porto, Portugal
Communication dans un congrès
hal-01181278v1
|
|
Injectivity of relational semantics for (connected) MELL proof-nets via Taylor expansion8th International Workshop on Computing with Terms and Graphs, Jul 2014, Vienna, Austria
Communication dans un congrès
hal-00998847v1
|
|
Proof-Net as Graph, Taylor Expansion as PullbackLogic, Language, Information, and Computation - 26th Workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2-5, 2019, Proceedings, pp.282-300, 2019, ⟨10.1007/978-3-662-59533-6_18⟩
Chapitre d'ouvrage
hal-02313538v1
|
|
Unifying lower bounds for algebraic machines, semantically2023
Pré-publication, Document de travail
hal-01921942v4
|
|
The Logic of Language: from the Distributional to the Structuralist Hypothesis through Types and Interaction2023
Pré-publication, Document de travail
hal-03064480v2
|
|
Eliminating infinitely many cuts in non-wellfounded MLL proof-nets2021
Pré-publication, Document de travail
hal-03235591v1
|
|
Lower bounds for algebraic machines, semantically2021
Pré-publication, Document de travail
hal-02487667v2
|