Filtrer vos résultats
- 24
- 17
- 1
- 19
- 14
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 33
- 33
- 1
- 2
- 1
- 3
- 1
- 2
- 1
- 1
- 1
- 1
- 2
- 5
- 1
- 2
- 1
- 3
- 4
- 2
- 2
- 3
- 1
- 1
- 1
- 39
- 3
- 18
- 18
- 7
- 4
- 1
- 1
- 1
- 1
- 1
- 1
- 42
- 5
- 4
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
42 résultats
|
|
triés par
|
|
Polynomial time in untyped elementary linear logicTheoretical Computer Science, 2020, 813, pp.117-142. ⟨10.1016/j.tcs.2019.10.002⟩
Article dans une revue
hal-02333452v1
|
||
|
Parametric mixed sequent calculus2005
Autre publication scientifique
hal-00382689v1
|
||
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
|
|||
About Translations of Classical Logic into Polarized Linear Logic2003, pp.11-20, ⟨10.1109/LICS.2003.1210040⟩
Communication dans un congrès
hal-00009139v1
|
|||
|
Sequentialization is as fun as bungee jumping7th International Workshop on Trends in Linear Logic and Applications (TLLA 2023), Jul 2023, Rome Sapienza Universita di Roma, Italy
Communication dans un congrès
hal-04515300v1
|
||
Focusing in OrthologicLogical Methods in Computer Science, 2017, 13 (3), pp.6. ⟨10.23638/LMCS-13(3:6)2017⟩
Article dans une revue
hal-01566869v1
|
|||
|
Quantitative Game Semantics for Linear LogicComputer Science Logic, Sep 2008, Bertinoro, Italy. pp.230--245, ⟨10.1007/978-3-540-87531-4_18⟩
Communication dans un congrès
hal-00270933v1
|
||
|
Game semantics for first-order logicLogical Methods in Computer Science, 2010, 6 (4), pp.3. ⟨10.2168/LMCS-6(4:3)2010⟩
Article dans une revue
hal-00528528v1
|
||
|
Type Isomorphisms for Multiplicative-Additive Linear Logic8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023), Jul 2023, Rome, Italy. pp.2, ⟨10.4230/LIPIcs.FSCD.2023.26⟩
Communication dans un congrès
hal-04082204v2
|
||
|
Sémantique Naturelle et Coq : vers la spécification et les preuves sur les langages à objetsRR-3307, INRIA. 1997
Rapport
inria-00073382v1
|
||
|
Polarized proof-nets and lambda-mu calculusTheoretical Computer Science, 2003, 290, pp.161-188. ⟨10.1016/S0304-3975(01)00297-3⟩
Article dans une revue
hal-00009114v1
|
||
Slicing polarized additive normalizationThomas Ehrhard and Jean-Yves Girard and Paul Ruet and Philip Scott. Linear Logic in Computer Science, Cambridge University Press, pp.247-282, 2004, London Mathematical Society Lecture Note Series
Chapitre d'ouvrage
hal-00009134v1
|
|||
|
On differential interaction nets and the pi-calculus2006
Pré-publication, Document de travail
hal-00096280v1
|
||
|
An exact correspondence between a typed pi-calculus and polarised proof-netsTheoretical Computer Science, 2010, 411 (22--24), pp.2223--2238. ⟨10.1016/j.tcs.2010.01.028⟩
Article dans une revue
hal-00483227v1
|
||
|
Interpreting a finitary pi-calculus in differential interaction netsInformation and Computation, 2010, 208 (6), pp.606--633. ⟨10.1016/j.ic.2009.06.005⟩
Article dans une revue
hal-00483780v1
|
||
Intersection Types with Subtyping by Means of Cut EliminationFundamenta Informaticae, 2012, 121 (1-4), pp.203-226. ⟨10.3233/FI-2012-776⟩
Article dans une revue
hal-00768868v1
|
|||
|
Intersection Subtyping with ConstructorsTwelfth Workshop on Developments in Computational Models and Ninth Workshop on Intersection Types and Related Systems, Jul 2018, Oxford, United Kingdom. pp.73-84, ⟨10.4204/EPTCS.293.6⟩
Communication dans un congrès
hal-02159762v1
|
||
|
Click and coLLecT An Interactive Linear Logic Prover5th International Workshop on Trends in Linear Logic and Applications (TLLA 2021), Jun 2021, Rome (virtual), Italy
Communication dans un congrès
lirmm-03271501v1
|
||
Polarized Proof-Nets: Proof-Nets for LC1999, pp.213-227
Communication dans un congrès
hal-00009136v1
|
|||
|
Cut Elimination for Monomial MALL Proof NetsLogic in Computer Science, Jun 2008, Pittsburgh, France. pp.486--497, ⟨10.1109/LICS.2008.31⟩
Communication dans un congrès
hal-00349555v1
|
||
|
Interpreting a Finitary Pi-Calculus in Differential Interaction NetsCONCUR 2007, Sep 2007, Lisboa, Portugal. pp.333-348, ⟨10.1007/978-3-540-74407-8⟩
Communication dans un congrès
hal-00148816v1
|
||
|
Interprétation calculatoire de la logique classique via le lambda-mu calcul et la machine de Krivine2002
Pré-publication, Document de travail
hal-00003753v1
|
||
Girard's Festschrift, Theoretical Computer Science (Volume 412, Issue 20)Elsevier, pp.240, 2011
Ouvrages
hal-00589711v1
|
|||
|
Obsessional cliques: a semantic characterization of bounded time complexity2006, pp.179-188, ⟨10.1109/LICS.2006.37⟩
Communication dans un congrès
hal-00096274v1
|
||
|
Syntax vs. Semantics: a polarized approachTheoretical Computer Science, 2005, 343, pp.177-206. ⟨10.1016/j.tcs.2005.05.012⟩
Article dans une revue
hal-00003759v1
|
||
On the categorical semantics of Elementary Linear LogicTheory and Applications of Categories, 2009, 22 (10), pp.269-301
Article dans une revue
hal-00398598v1
|
|||
The anatomy of innocence revisitedNov 2006, pp.224-235, ⟨10.1007/11944836_22⟩
Communication dans un congrès
istex
hal-00124569v1
|
|||
|
An Anti-Locally-Nameless Approach to Formalizing QuantifiersCertified Programs and Proofs, Jan 2021, virtual, Denmark. pp.300-312, ⟨10.1145/3437992.3439926⟩
Communication dans un congrès
hal-03096253v1
|
||
|
Resource-Tracking Concurrent GamesFoundations of Software Science and Computation Structures, Apr 2019, Prague, Czech Republic. pp.27-44, ⟨10.1007/978-3-030-17127-8_2⟩
Communication dans un congrès
hal-02096306v1
|
||
Around Classical and Intuitionistic Linear Logicsthe 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2018, Oxford, United Kingdom. ⟨10.1145/3209108.3209132⟩
Communication dans un congrès
hal-01840882v1
|
- 1
- 2