Filtrer vos résultats
- 64
- 51
- 1
- 57
- 32
- 14
- 7
- 5
- 1
- 8
- 1
- 114
- 12
- 2
- 2
- 1
- 1
- 788
- 659
- 609
- 589
- 532
- 478
- 431
- 391
- 369
- 324
- 321
- 317
- 312
- 307
- 305
- 294
- 290
- 283
- 266
- 259
- 251
- 226
- 220
- 218
- 218
- 218
- 216
- 215
- 213
- 212
- 211
- 205
- 202
- 201
- 200
- 197
- 196
- 194
- 192
- 191
- 191
- 189
- 183
- 182
- 179
- 179
- 178
- 176
- 174
- 171
- 170
- 167
- 164
- 162
- 161
- 161
- 159
- 157
- 157
- 156
- 155
- 154
- 154
- 152
- 152
- 152
- 150
- 150
- 149
- 148
- 147
- 147
- 144
- 142
- 142
- 141
- 141
- 141
- 140
- 139
- 139
- 139
- 138
- 137
- 137
- 136
- 136
- 136
- 136
- 136
- 135
- 135
- 133
- 132
- 131
- 131
- 131
- 131
- 131
- 128
- 2
- 4
- 4
- 2
- 4
- 6
- 1
- 6
- 5
- 9
- 8
- 3
- 2
- 3
- 4
- 2
- 4
- 4
- 1
- 4
- 4
- 5
- 4
- 11
- 6
- 8
- 113
- 3
- 49
- 29
- 19
- 18
- 13
- 13
- 12
- 12
- 9
- 6
- 5
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 14
- 9
- 9
- 8
- 8
- 7
- 6
- 5
- 5
- 5
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 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
- 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
|
Non-linear Second order Abstract Categorial Grammars and deletionNLCS 2015: Natural Language and Computer Science, Makoto Kanazawa, 2015, Kyoto, Japan
Communication dans un congrès
hal-01251127v1
|
||
|
A Logical Framework for Systems Biology[Research Report] 2014, pp.34
Rapport
hal-00981409v1
|
||
Concurrent Programming as Proof Net ConstructionMathematical Structures in Computer Science, 1998, 8 (6), pp.681-710
Article dans une revue
inria-00098491v1
|
|||
Type inference in intuitionistic linear logic12th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2010), Jul 2010, Hagenberg, Austria. pp.219-230, ⟨10.1145/1836089.1836118⟩
Communication dans un congrès
hal-00543120v1
|
|||
|
A Linear Perspective on Cut-Elimination for Non-wellfounded Sequent Calculi with Least and Greatest Fixed-PointsTABLEAUX 2023 - 32nd International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, Sep 2023, Prague, Czech Republic. pp.203-222, ⟨10.1007/978-3-031-43513-3_12⟩
Communication dans un congrès
hal-04308897v1
|
||
|
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
|
||
From Intuitionistic Proof Nets to Interaction GrammarsTAG + 5, Université Paris 7, 2000, Paris/France, 9 p
Communication dans un congrès
inria-00147384v1
|
|||
Proof Plans and Proof Nets in Linear Logic -AbstractFloc'99 Workshop on Strategies in Automated Deduction, 1999, Trento, Italy, 2 p
Communication dans un congrès
inria-00098989v1
|
|||
Labelled Proof Systems for Intuitionistic ProvabilityD. Basin, M. D'Agostino, D.M. Gabbay, S. Matthews, L. Vigano. Labelled Deduction, 17 (17), Kluwer Academic Publishers, 31 p, 2000, Applied Logic Series, 0-7923-6237-3
Chapitre d'ouvrage
inria-00098993v1
|
|||
|
A PSPACE-complete fragment of second-order linear logicTheoretical Computer Science, 1999, 224 (1-2), pp.267-289. ⟨10.1016/S0304-3975(98)00315-6⟩
Article dans une revue
inria-00098816v1
|
||
|
PSPACE-Completeness of a Thread Criterion for Cyclic Proofs in Linear Logic with Least and Greatest Fixed PointsTABLEAUX 2019 - 28th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, Sep 2019, London, United Kingdom. ⟨10.1007/978-3-030-29026-9_18⟩
Communication dans un congrès
hal-02173207v1
|
||
Linear Dependent Types for Differential Privacy40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013, Rome, Italy, Italy. pp.357--370, ⟨10.1145/2429069.2429113⟩
Communication dans un congrès
hal-00909340v1
|
|||
|
Least and Greatest Fixed Points in Ludics2015
Pré-publication, Document de travail
hal-01178396v1
|
||
|
Cut-elimination for the circular modal mu-calculus: linear logic and super exponentials to the rescue2024
Pré-publication, Document de travail
hal-04496648v1
|
||
|
Proof Nets and Explicit SubstitutionsFOSSACS, 2000, Berlin, Germany. pp.63-81
Communication dans un congrès
hal-00384955v1
|
||
Connection-based proof search in propositional BI logic18th International Conference on Automated Deduction - CADE-18, 2002, Copenhagen/Denmark, pp.111-128
Communication dans un congrès
inria-00100790v1
|
|||
LINK: a Proof Environment based on Proof netsInternational Conference on Automated Reasoning with Analytic Tableaux and Related Methods - TABLEAUX'02, 2002, Copenhagen, Denmark, pp.330-334
Communication dans un congrès
inria-00100791v1
|
|||
|
From Proof nets to the Free *-Autonomous CategoriesLogical Methods in Computer Science, 2006, 2 (4:3), 44 p. ⟨10.2168/LMCS-2(4:3)2006⟩
Article dans une revue
inria-00099865v2
|
||
|
Focalisation and Classical Realisability (version with appendices)18th EACSL Annual Conference on Computer Science Logic - CSL 09, Sep 2009, Coimbra, Portugal. pp.409-423, ⟨10.1007/978-3-642-04027-6_30⟩
Communication dans un congrès
inria-00409793v2
|
||
|
The Geometry of SynchronizationJoint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jul 2014, Vienna, Austria. ⟨10.1145/2603088.2603154⟩
Communication dans un congrès
hal-01091560v1
|
||
|
Connection-based proof construction in Non-Commutative Logic10th International Conference on Logic for Programming Artificial Intelligence and Reasoning 2003 - LPAR'03, 2003, Almaty/Kazakhstan, pp.422 - 436, ⟨10.1007/b13986⟩
Communication dans un congrès
inria-00099554v1
|
||
Corrigendum to Galmiche's and Perrier's ``On Proof Normalization in Linear LogicTheoretical Computer Science, 1998, 206 (1-2), pp.353-354
Article dans une revue
inria-00098573v1
|
|||
Words as modules: a lexicalised grammar in the framework of linear logic proof nets.Mathematical & Computational Analysis of Natural Language (Proceedings of International conference on mathematical linguistics II), 1998, Tarragone, pp.129-144
Communication dans un congrès
inria-00098440v1
|
|||
Quantales as completions of ordered monoids: revised semantics for Intuitionistic Linear LogicElectronic Notes in Theoretical Computer Science, 2000, 35, 15 p
Article dans une revue
inria-00099226v1
|
|||
|
On paths-based criteria for polynomial time complexity in proof-netsFoundational and Practical Aspects of Resource Analysis (FOPARA) 2013, Aug 2013, Bertinoro, Italy. pp.127--142, ⟨10.1007/978-3-319-12466-7_8⟩
Communication dans un congrès
hal-00992578v1
|
||
|
Intersection Types and Runtime Errors in the Pi-CalculusProceedings of the ACM on Programming Languages, 2019, 3 (POPL), pp.1-29. ⟨10.1145/3290320⟩
Article dans une revue
hal-02399565v1
|
||
|
Call-by-value non-determinism in a linear logic type disciplineLFCS - Logical Foundations of Computer Science - 2013, Jan 2013, San Diego, CA, United States. pp.164-178, ⟨10.1007/978-3-642-35722-0_12⟩
Communication dans un congrès
hal-00919463v1
|
||
|
Geometry of resource interaction and Taylor–Ehrhard–Regnier expansion: a minimalist approachMathematical Structures in Computer Science, 2016, pp.1 - 43. ⟨10.1017/S0960129516000311⟩
Article dans une revue
hal-01400359v1
|
||
|
Cyclic proofs, system T, and the power of contractionProceedings of the ACM on Programming Languages, 2021, ⟨10.1145/3434282⟩
Article dans une revue
hal-02487175v2
|
||
|
Decision Problems for Linear Logic with Least and Greatest Fixed Points7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022), Aug 2022, Haifa, Israel. ⟨10.4230/LIPIcs.FSCD.2022.20⟩
Communication dans un congrès
hal-03867393v1
|