Articles parus dans des revues internationales avec comité de lecture
- Y.
Lafont, The linear abstract machine,
Theoretical Computer Science
59, p. 157-180, Elsevier (1988)
- Y.
Lafont & A. Prouté, Church-Rosser
property and homology
of monoids, Mathematical Structures in Computer Science 1 (3), p.
297-326,
Cambridge University Press (1991)
[PS]
- Y.
Lafont, A new finiteness condition
for monoids presented by complete
rewriting systems (after Craig C. Squier), Journal of Pure and
Applied
Algebra 98, p. 229-244, Elsevier (1995)
[PS]
- Y.
Lafont, The
undecidability of second order linear logic without exponentials,
Journal of Symbolic Logic 61 (2), p. 541-548, Association for Symbolic
Logic (1996) [PS]
- Y.
Lafont & A.
Scedrov, The
undecidability of second order multiplicative linear logic,
Information
and Computation 125 (1), p. 46-51, Academic Press (1996) [PS]
- Y.
Lafont, Interaction
Combinators, Information and Computation 137 (1), p. 69-101,
Academic
Press (1997) [PS]
- Y.
Lafont, The
finite model property for various fragments of linear logic,
Journal
of Symbolic Logic 62 (4), p. 1202-1208, Association for Symbolic Logic
(1997) [PS]
- P. Dehornoy & Y.
Lafont, Homology
of Gaussian groups, Annales de l'Institut Fourier 53 (2), p.
489-540, Université Joseph Fourier
(2003) [PDF]
- Y.
Lafont, Towards
an Algebraic Theory of Boolean Circuits, Journal of Pure and
Applied
Algebra 184 (2-3), p. 257-310, Elsevier (2003) [PDF]
- Y.
Lafont, Soft
Linear Logic and Polynomial Time, Theoretical Computer Science 318
(special issue on Implicit Computational
Complexity) p. 163-180, Elsevier (2004)
[PS]
- Y.
Lafont, Algebra
and geometry of rewriting, Applied Categorical Structures 15,
p. 415-437, Springer-Verlag
(2007) [PDF]
- Y.
Lafont & F.
Métayer, Polygraphic resolutions
and homology of monoids, Journal of Pure and Applied Algebra 213 (6), p. 947-968, Elsevier (2009)
- Y.
Lafont, F.
Métayer & Krzysztof Worytkiewicz, A folk model structure on omega-cat, Advances in Mathematics 224 (3), p. 1183-1231, Elsevier (2010)
Articles parus dans des actes de colloques internationaux avec comité de lecture
- J.-Y. Girard & Y.
Lafont, Linear logic and lazy computation,
in Theory and Practice of Software Development (TAPSOFT 87),
Lecture
Notes in Computer Science 250, p. 52-66, Springer-Verlag (1987)
- Y.
Lafont, Interaction Nets, in Principles
of Programming Languages
(POPL 90), p. 95-108, ACM Press (1990)
- Y.
Lafont & T.
Streicher, Games Semantics for
Linear Logic,
in Logic in Computer Science (LICS 91), p. 43-50, IEEE Computer
Society Press (1991)
- Y.
Lafont, Penrose diagrams and
2-dimensional rewriting, in Applications
of Categories in Computer Science, London Mathematical Society
Lecture
Note Series 177, p. 191-201, Cambridge University Press (1992)
- Y.
Lafont & P. Rannou, Diagram rewriting for orthogonal matrices: a study of critical peaks, in Rewriting Techniques and Applications,
19th International Conference, Hagenberg, Austria, July 15-17,
Lecture Notes in Computer Science 5117, p.
232-245, Springer-Verlag
(2008) [PDF]
- Y.
Lafont, Diagram
rewriting and operads, in Operads 2009, ed. J.-L. Loday & B. Vallette, Séminaires et Congrès 26, p. 163-179, SMF (2011) [PDF]
Chapitres de livres
- J.-Y. Girard
(translated and with appendices by Y. Lafont & P. Taylor), Proofs and Types, Cambridge
Tracts in Theoretical Computer Science 7, Cambridge University Press (1989)
[volume épuisé mais accessible en format
électronique : DVI, PS, A5
PS booklet, PDF]
- Y.
Lafont, Calcul
des séquents et déduction naturelle, in Logique
et informatique : une introduction, ed. B. Courcelle, Collection
Didactique,
p. 99-115, INRIA (1991) [PS]
- Y.
Lafont, Che
cos'è la logica lineare? (traduit en italien par Miriam
Franchella), in Letture di logica,
Fondamenti della Matematica, Linee di Ricerca Attuali, p.
403-423, Edizioni Universitarie di Lettere Economia Diritto (1993)
- Y.
Lafont, From Proof-Nets to
Interaction Nets, in Advances in
Linear Logic, ed. J.Y. Girard, Y. Lafont, & L. Regnier, London
Mathematical Society Lecture Note Series 222, p. 225-247, Cambridge
University
Press (1995)
- Y.
Lafont, Equational reasoning with
2-dimensional diagrams, in
Term
Rewriting, Lecture Notes in Computer Science 909, p. 170-195,
Springer-Verlag
(1995)
Autres documents
- Y.
Lafont, Logiques, catégories
et machines, thèse
de doctorat, Université de Paris 7 (1988)
- Y.
Lafont, B. Reus
& T.
Streicher, Continuations Semantics
or Expressing
Implication by Negation, Technical Report 9321,
Ludwig-Maximilians-Universität,
München (1993) [PS]
- Y.
Lafont, Combinateurs d'interaction
(court-métrage d'animation, 1995) [avi, wmv, mp4]
- Y.
Lafont, Les
réseaux d'interaction (1998) [PS]
- Y.
Lafont, Introduction
to interaction nets (version anglaise du
précédent) [PS]
- Y.
Lafont, The Linear
Logic Pages (1999) [HTML,
PDF]
- Y.
Lafont, Avatars
du calcul (2001) [PS]
- Y.
Lafont, Réécriture
et problème du mot, Gazette des mathématiciens 120, p 27-38, SMF (2009) [PDF]