Institut de Mathématiques de Luminy

BIBLIOGRAPHIE - Yves LAFONT


Articles acceptés ]

Année
Publications
Files Type
2012 Lafont Yves.
Petit panorama du vocabulaire mathématique.
Images des Maths, article de vulgarisation, septembre 2012.
link AP
2011 Lafont Yves.
Diagram rewriting and operads.
Operads 2009, ed. J.-L. Loday & B. Vallette, Séminaires et Congrès 26, p. 163-179, SMF, 2011.
PDF ACTI
2010 Lafont Yves, Métayer François, Worytkiewicz Krzysztof.
A folk model structure on omega-cat.
Adv. Math. 224, no. 3, 1183--123, 2010.
Hal ACL
2009 Lafont Yves, Métayer François.
Polygraphic resolutions and homology of monoids.
Journal of Pure and Applied Algebra 213, p. 947-968, 2009.
Hal ACL
  Lafont Yves.
Réécriture et problème du mot.
Gazette des mathématiciens 120, avril 2009.
pdf
279 k
OS
2008 Lafont Yves, Rannou Pierre.
Diagram rewriting for orthogonal matrices: a study of critical peaks.
Rewriting Techniques and Applications, 19th International Conference, Hagenberg, Austria, July 15-17, Lecture Notes in Computer Science 5117, p. 232-243, Springer-Verlag, 2008.

85 k
ACTI
2007 Lafont Yves.
Algebra and geometry of rewriting.
Applied Categorical Structures 15, p. 415-437, Springer-Verlag, 2007.
 
136 k
ACL
2004 Lafont Yves.
Soft linear logic and polynomial time.
Theoret. Comput. Sci. 318, no. 1-2, 163--180, 2004.
 
2003 Lafont Yves.
Towards an algebraic theory of Boolean circuits.
J. Pure Appl. Algebra 184, no. 2-3, 257--310, 2003.
 
429 k
 
  Dehornoy P., Lafont Yves.
Homology of Gaussian groups.
Ann. Inst. Fourier (Grenoble) 53, no. 2, 489--540, 2003.  abstract
 
 3,5 M    793 k
 
1998 Ehrhard Thomas, Lafont Yves, Régnier Laurent.
Logic and models of computation,
Papers from the conference held in Marseille, September 1996. Edited by Thomas Ehrhard, Yves Lafont and Laurent Regnier. Math. Structures Comput. Sci. 8, no. 6. Cambridge University Press, New York, pp. 541--710, 1998
   
1997 Lafont Yves.
The finite model property for various fragments of linear logic,
J. Symbolic Logic 62, no. 4, 1202--1208, 1997

[Laf97a]
 
  Lafont Yves.
Interaction combinators,
Inform. and Comput. 137, no. 1, 69--101, 1997
Erratum: "Interaction combinators" [Inform. and Comput. 137 (1997), no. 1, 69--101; 1468878]
Inform. and Comput. 142, no. 2, 237, 1998

[Laf97b]
 
1996 Lafont Yves.
The undecidability of second order linear logic without exponentials,
J. Symbolic Logic 61, no. 2, 541--548, 1996

[Laf96]
 
  Lafont Yves, Scedrov Andre.
The undecidability of second order multiplicative linear logic,
Inform. and Comput. 125, no. 1, 46--51, 1996

[LS96]
 
1995 Lafont Yves.
A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier),
J. Pure Appl. Algebra 98, no. 3, 229--244, 1995
[Laf95c]  
  Lafont Yves.
Equational reasoning with 2-dimensional diagrams,
Term rewriting (Font Romeux, 1993), 170--195, Lecture Notes in Comput. Sci., 909, Springer, Berlin, 1995
[Laf95a]  
  Lafont Yves.
From proof-nets to interaction nets,
Advances in linear logic (Ithaca, NY, 1993), 225--247, London Math. Soc. Lecture Note Ser., 222, Cambridge Univ. Press, Cambridge, 1995.
[Laf95b]  
  Girard Jean-Yves, Lafont Yves, Régnier Laurent.
Advances in linear logic,
Proceedings of the workshop held at Cornell University, Ithaca, New York, June 14--18, 1993. Edited by Jean-Yves Girard, Yves Lafont and Laurent Regnier. London Mathematical Society Lecture Note Series, 222. Cambridge University Press, Cambridge, 1995
   
1992 Lafont Yves.
Diagrammes de Penrose et réécriture en dimension 2 [Penrose diagrams and rewriting in dimension 2],
Cahiers Topologie Géom. Différentielle Catégoriques 33, no. 3, 267--275, 1992
   
  Lafont Yves.
Penrose diagrams and 2-dimensional rewriting,
Applications of categories in computer science (Durham, 1991), 191--201, London Math. Soc. Lecture Note Ser., 177, Cambridge Univ. Press, Cambridge, 1992
   
1991 Lafont Yves.
Calcul des séquents et déduction naturelle [Sequent calculus and natural deduction].
Logique et informatique: une introduction, 99--115, Collect. Didact., 8, INRIA, Rocquencourt, 1991
 
  Lafont Yves, Streicher T.
Games semantics for linear logic.
Logic in Computer Science (LICS 91), 43-50, IEEE Computer Society Press, 1991
   
  Lafont Yves, Prouté Alain.
Church-Rosser property and homology of monoids,
Math. Structures Comput. Sci. 1, no. 3, 297--326, 1991
   
1990 Lafont Yves.
Interaction nets.
Principles of Programming Languages (POPL 90), 95-108, ACM Press, 1990
   
1989 Girard Jean-Yves, Taylor Paul, Lafont Yves.
Proofs and types.
Cambridge Tracts in Theoretical Computer Science, 7. Cambridge University Press, Cambridge-New York, 1989
   
  Lafont Yves.
Primitive recursive categories and machines.
Journées E.L.I.T. (Esquisses, Logique et Informatique Théorique), Vol. 1 (Paris, 1988). Diagrammes 22, 7--13, 1989
   
1988 Lafont Yves.
Corrigenda : "The linear abstract machine".
Theoret. Comput. Sci. 62, no. 3, 327--328, 1988
   
  Lafont Yves.
The linear abstract machine.
International Joint Conference on Theory and Practice of Software Development (Pisa, 1987). Theoret. Comput. Sci. 59, no. 1-2, 157--180, 1988
   
1987 Girard Jean-Yves, Lafont Yves.
Linear logic and lazy computation.
TAPSOFT '87, Vol. 2 (Pisa, 1987), 52--66, Lecture Notes in Comput. Sci., 250, Springer, Berlin-New York, 1987
   

Thèse
(Thesis)
 
1988 Logiques, catégories et machines.
Thèse de doctorat, Université de Paris VII,1988
 



Articles soumis ou acceptés

2002
Lafont Yves.
Les réseaux d'interactions [Interaction nets].
To appear in Images des Mathématiques, CNRS, 2002



Last update: october 10, 2012, EL.