Baillot Patrick, Pedicini Marco.
Elementary complexity and geometry of interaction (extended abstract).
Typed lambda calculi and applications (L'Aquila, 1999), 25--39, Lecture Notes in Comput. Sci., 1581, Springer, Berlin, 1999

Ehrhard Thomas, Regnier Laurent.
The differential lambda-calculus.
Theoretical Computer Science (accepté), 2002.

Ehrhard Thomas.
A completeness theorem for symmetric product phase spaces.
Journal of Symbolic Logic (accepté), 2002.

Bucciarelli Antonio, Ehrhard Thomas.
On phase semantics and denotational semantics: the exponentials.
Ann. Pure Appl. Logic 109, no. 3, 205--241, 2001.

Ehrhard Thomas.
On Koethe sequence spaces and linear logic.
Mathematical Structures in Computer Science, Cambridge University Press (accepté), 2001.

Bucciarelli Antonio, Ehrhard Thomas.
On phase semantics and denotational semantics in multiplicative-additive linear logic.
Annals of Pure and Applied Logic 102, no. 3, 247--282, 2000.

Ehrhard Thomas.
Parallel and serial hypercoherences.
Theoret. Comput. Sci. 247, no. 1-2, 39--81, 2000.

Ehrhard Thomas.
A relative PCF-definability result for strongly stable functions and some corollaries.
Information and Computation 152, no.1, pp.111-137, Academic Press, 1999.

Barreiro Nuno, Ehrhard Thomas.
Quantitative semantics revisited (extended abstract).
Typed lambda calculi and applications (L'Aquila, 1999), 40--53, Lecture Notes in Comput. Sci., 1581, Springer, Berlin, 1999.

Faggian Claudia, Fleury-Donnadieu Marie-Renée, Quatrini Myriam.
An introduction to uniformity in Ludics.
The book Linear Logic in Computer Science, T. Ehrhard, J.-Y. Girard, P. Ruet, P. Scott eds., 2002.

Sambin, Giovanni, Battilotti Giulia, Faggian Claudia.
Basic logic : reflection, symmetry, visibility.
J. Symbolic Logic 65, no. 3, 979--1013, 2000.

Faggian Claudia.
Proof construction and non commutativity : a cluster calculus.
Proceedings of PPDP 2000, International Conference on Principles and Practice of Declarative Programming, ACM Press, 2000.

Faggian Claudia, Fleury-Donnadieu Marie-Renée, Quatrini Myriam.
An introduction to uniformity in Ludics.
The book Linear Logic in Computer Science, T. Ehrhard, J.-Y. Girard, P. Ruet, P. Scott eds., 2002.

Girard Jean-Yves.
From foundations to ludics.
Proof & System Reliability, NATO Science Series, vol.62, Kluwer, 2002.

Girard Jean-Yves.
Locus solum : from the rules of logic to the logic of rules.
Math. Structures Comput. Sci. 11, no. 3, 301--506, 2001.

Girard Jean-Yves.
Du pourquoi au comment : la théorie de la démonstration de 1950 à nos jours [From why to how : proof theory from 1950 to today].
Development of mathematics 1950--2000, 515--545, Birkhäuser, Basel, 2000

Girard Jean-Yves.
On the meaning of logical rules II : multiplicative/additive case.
In Steinbrüggen F.L. Bauer, editor, Foundation of Secure Computation, Amsterdam, IOS Press NATO series F 175, 2000

Girard Jean-Yves.
Typed lambda calculi and applications.
Proceedings 4th International Conference (TLCA'99) held in L'Aquila, April 7-9, 1999. Edited by J.-Y. Girard. Lecture Notes in Computer Science, 1581. Springer-Verlag, Berlin, viii+397 pp. ISBN: 3-540-65763-0, 1999

Girard Jean-Yves.
Linear logic. I.
Papers from the meeting held in Tokyo, March 28-April 2, 1996. Edited by J.-Y. Girard, M. Okada and A. Scedrov. Theoret. Comput. Sci. {227}, no. 1-2. Elsevier Science Publishers, B.V., Amsterdam, pp. ix--xii and 1--396, 1999

Girard Jean-Yves.
Coherent banach spaces : a continuous denotational semantics.
Linear logic, I (Tokyo, 1996). Theoretical Computer Science, 227, no. 1-2, pp.275-297, 1999

Girard Jean-Yves.
On denotational completeness.
Linear logic, I (Tokyo, 1996). Theoretical Computer Science, 227, no. 1-2, pp.249--273, 1999

Girard Jean-Yves.
On the meaning of logical rules I : syntax versus semantics.
Computational logic (Marktoberdorf, 1997), U.Berger and H. Schwichtenberg Editors, Heidelberg, 215--272, NATO Adv. Sci. Inst. Series F 165 Comput. Systems Sci., 165, Springer, Berlin, 1999

Boudabbous Youssef, Dammak Jamel, Ille Pierre
Indecomposability and duality of tournaments,
Discrete Math., 223, no.1-3, 55-82, 2000

Lafont Yves.
Soft linear logic and polynomial time.
Theoretical Computer Science (accepté), 2002

Dehornoy P., Lafont Yves.
Homology of Gaussian groups.
Les Annales de l'Institut Fourier (accepté), 2002

Laurent Olivier.
Polarized proof-nets and lambda-mu calculus.
Theoretical Computer Science (accepté), 2002.

Laurent Olivier, Quatrini Myriam, Tortora de Falco Lorenzo.
Polarized and Focalized Linear and Classical Proofs.
Annals of Pure and Applied Logic (accepté), 2002.

Laurent Olivier, Tortora de Falco Lorenzo.
Slicing polarized additive normalization.
Book on Linear Logic (accepté), 2001.

Laurent Olivier.
A Token Machine for Full Geometry of Interaction (extended abstract).
Samson Abramsky, editor, Typed Lambda Calculi and Applications '01, volume 2044 of Lecture Notes in Computer Science, pages 283-297. © Springer-Verlag, May 2001

Laurent Olivier.
Polarized Proof-Nets: Proof-Nets for LC (extended abstract).
Jean-Yves Girard, editor, Typed Lambda Calculi and Applications '99, volume 1581 of LNCS, pages 213-227. © Springer-Verlag. April 1999.

Lippi Sylvain.
Encoding left reduction in the lambda-calculus with interaction nets.
Mathematical Structures in Computer Science (accepté), 2002.

Lippi Sylvain.
in2: a Graphical Interpreter for Interaction Nets.
Proceedings of Rewriting Techniques and Applications (RTA '02). Springer Verlag, 2002.

Lippi Sylvain.
Package Duplication in Interaction Nets and Weak Head Reduction in the lambda-calculus.
Electronic Notes in Theoretical Computer Science 72, no. 1, 2002.

Attali Isabelle, Caromel Denis, Lippi Sylvain.
From a Specification to an Equivalence Proof in Object-Oriented Parallelism .
FMPPTA'99 : Modeling and Proving (Fourth Workshop in Formal Methods for Parallel Programming, Theory and Applications)", LNCS 1586, pp 1197-1214, 1999.

Boudabbous Youssef, Lopez Gérard
Procédé de construction des relations binaires non-(3)-reconstructibles [A construction process for non-(3)-reconstructible binary relations],
C. R. Acad. Sci. Paris Sér. I Math. 329, no. 10, 845--848, 1999

Mogbil Virgile.
Quadratic correctness criterion for Non commutative Logic.
Computer science logic (Paris, 2001), 69--83, Lecture Notes in Comput. Sci., 2142, Springer, Berlin, 2001

Krantz Thomas, Mogbil Virgile.
Encoding Hamiltonian circuits into multiplicative linear logic.
Theoret. Comput. Sci. 266, no. 1-2, 987--996, 2001.

Laurent Olivier, Quatrini Myriam, Tortora de Falco Lorenzo.
Polarized and Focalized Linear and Classical Proofs.
Annals of Pure and Applied Logic (accepté), 2002.

Faggian Claudia, Fleury-Donnadieu Marie-Renée, Quatrini Myriam.
An introduction to uniformity in Ludics.
The book Linear Logic in Computer Science, T. Ehrhard, J.-Y. Girard, P. Ruet, P. Scott eds., 2002.

Rauzy Antoine.
Towards an efficient implementation of Mocus.
IEEE Transactions on Reliability (accepté), 2001.

Rauzy Antoine.
Mathematical Foundation of Minimal Cutsets.
IEEE Transactions on Reliability (accepté), 2001.

Rauzy Antoine.
A new methodology to handle boolean models with loops.
IEEE Transactions on Reliability (accepté), 2001.

Rauzy Antoine.
Modes automata and their compilation into fault trees.
Reliability Engineering and System Safety (accepté), 2002.

Dutuit Y., Rauzy Antoine.
New insights in the assessment of k-out-of-n and related systems.
Reliability Engineering and System Safety, 72(3), 303--314, 2001.

Ehrhard Thomas, Regnier Laurent.
The differential lambda-calculus.
Theoretical Computer Science (accepté), 2002.

Danos Vincent , Regnier Laurent
Reversible, irreversible and optimal lambda-machines,
Linear logic, I (Tokyo, 1996). Theoret. Comput. Sci. 227, no. 1-2, 79--97, 1999

Maieli Roberto, Ruet Paul.
Non-commutative logic. III. Focusing proofs.
Information and Computation, Academic Press (accepté), 2002.

Andreoli J.-M., Maieli Roberto, Ruet Paul.
Constraint based proof construction in non-commutative logic.
Theoretical Computer Science, Elsevier (accepté), 2002.

Blute R. F., Lamarche F., Ruet Paul.
Entropic Hopf algebras and models of non-commutative logic.
Theory and Applications of Categories 10 (accepté), 2002.

Fages François, Ruet Paul, Soliman Sylvain.
Linear concurrent constraint programming: operational and phase semantics.
Inform. and Comput., vol.165, no.1, pp.14--41, 2001.

Ruet Paul.
Non-commutative logic. II. Sequent calculus and phase semantics.
The Lambek Festschrift : mathematical structures in computer science (Montreal, QC, 1997). Math. Structures Comput. Sci. 10, no. 2, 277--312, 2000. 

Abrusci Vito Michele, Ruet Paul.
Non-commutative logic. I. The multiplicative fragment.
Ann. Pure Appl. Logic 101, no. 1, 29--64, 2000.