Filtrer vos résultats
- 64
- 51
- 1
- 57
- 32
- 14
- 7
- 5
- 1
- 8
- 1
- 114
- 12
- 2
- 2
- 1
- 1
- 783
- 660
- 606
- 588
- 519
- 477
- 429
- 389
- 366
- 323
- 315
- 315
- 311
- 307
- 303
- 293
- 290
- 280
- 267
- 258
- 250
- 225
- 219
- 218
- 217
- 216
- 215
- 214
- 210
- 208
- 208
- 205
- 202
- 200
- 196
- 196
- 195
- 192
- 191
- 190
- 190
- 188
- 183
- 180
- 178
- 178
- 176
- 174
- 172
- 170
- 170
- 165
- 164
- 162
- 160
- 160
- 159
- 157
- 157
- 156
- 154
- 153
- 152
- 152
- 150
- 150
- 150
- 149
- 149
- 148
- 147
- 147
- 145
- 142
- 142
- 141
- 140
- 140
- 140
- 139
- 138
- 138
- 137
- 137
- 137
- 136
- 136
- 135
- 135
- 135
- 135
- 134
- 133
- 131
- 131
- 131
- 131
- 131
- 130
- 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
|
||
|
Proof Nets and Explicit SubstitutionsFOSSACS, 2000, Berlin, Germany. pp.63-81
Communication dans un congrès
hal-00384955v1
|
||
|
Cut-elimination for the circular modal mu-calculus: linear logic and super exponentials to the rescue2024
Pré-publication, Document de travail
hal-04496648v1
|
||
|
A Hybrid Linear Logic for Constrained Transition Systems with Applications to Molecular Biology[Research Report] 2013, pp.30
Rapport
inria-00402942v5
|
||
|
A semantic measure of the execution time in Linear Logic[Research Report] RR-6441, INRIA. 2008, pp.48
Rapport
inria-00206099v4
|
||
|
Some proof-theoretical approaches to Monadic Second-Order logicLogic in Computer Science [cs.LO]. Université de Lyon; Uniwersytet Warszawski. Wydział Matematyki, Informatyki i Mechanik, 2020. English. ⟨NNT : 2020LYSEN028⟩
Thèse
tel-02954006v1
|
||
|
Linear Haskell: practical linearity in a higher-order polymorphic languageProceedings of the ACM on Programming Languages, 2017, 2 (POPL), pp.1-29. ⟨10.1145/3158093⟩
Article dans une revue
hal-01673536v1
|
||
|
Exponentials as Substitutions and the Cost of Cut Elimination in Linear LogicLICS 2022 - 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Aug 2022, Haifa, Israel. pp.1-15, ⟨10.1145/3531130.3532445⟩
Communication dans un congrès
hal-03912448v1
|
||
|
Connection Methods in Linear Logic and Proof nets ConstructionTheoretical Computer Science, 2000, 232 (1-2), pp.231-272. ⟨10.1016/S0304-3975(99)00176-0⟩
Article dans une revue
inria-00099205v1
|
||
|
Investigating the expressivity of linear logic subsystems characterizing polynomial timeOther [cs.OH]. Ecole normale supérieure de lyon - ENS LYON, 2015. English. ⟨NNT : 2015ENSL1001⟩
Thèse
tel-01204992v1
|
||
|
Deep Inference, Expansion Trees, and Proof Graphs for Second Order Propositional Multiplicative Linear Logic[Research Report] RR-9071, Inria Saclay Ile de France. 2017, pp.38
Rapport
hal-01526831v1
|
||
Proof-search in implicative linear logic as a matching problemInternational Conference on Logic for Programming & Automated Reasoning - LPAR'2000, 2000, Reunion Island, France, pp.257-274
Communication dans un congrès
inria-00099221v1
|
|||
Vector Addition Tree Automata19th Annual IEEE Symposium on Logic in Computer Science - LICS'04, 2004, Turku, Finland, France. pp.64-73
Communication dans un congrès
inria-00100081v1
|
|||
On the complexity of higher-order matching in the linear $\lambda$-calculusInternational Conference on Rewriting Techniques and Applications - RTA'2003, Jun 2003, Valencia, Spain, pp.234-245
Communication dans un congrès
inria-00099593v1
|
|||
On Proof Nets for Multiplicative Linear Logic with Units18th International Workshop on Computer Science Logic - CSL'2004, 2004, Karpacz, Poland, pp.145--159
Communication dans un congrès
inria-00100244v1
|
|||
Light logics and optimal reduction: Completeness and complexityInformation and Computation, 2011, 209 (2), pp.118-142. ⟨10.1016/j.ic.2010.10.002⟩
Article dans une revue
istex
hal-00798315v1
|
|||
|
Handsome Non-Commutative Proof-Nets: perfect matchings, series-parallel orders and Hamiltonian circuits[Research Report] RR-5409, INRIA. 2004, pp.25
Rapport
inria-00071248v1
|
||
Focusing in OrthologicFormal Structures for Computation and Deduction, Jun 2016, Porto, Portugal. pp.25, ⟨10.4230/LIPIcs.FSCD.2016.25⟩
Communication dans un congrès
hal-01306132v1
|