![]() | ![]() |
2008 | ||
---|---|---|
16 | EE | Yves Lafont, Pierre Rannou: Diagram Rewriting for Orthogonal Matrices: A Study of Critical Peaks. RTA 2008: 232-245 |
2007 | ||
15 | EE | Yves Lafont: Algebra and Geometry of Rewriting. Applied Categorical Structures 15(4): 415-437 (2007) |
2004 | ||
14 | EE | Yves Lafont: Soft linear logic and polynomial time. Theor. Comput. Sci. 318(1-2): 163-180 (2004) |
1998 | ||
13 | Thomas Ehrhard, Yves Lafont, Laurent Regnier: Foreword. Mathematical Structures in Computer Science 8(6): 541 (1998) | |
1997 | ||
12 | Yves Lafont: Two-Dimensional Rewriting. RTA 1997: 228-229 | |
11 | Yves Lafont: Interaction Combinators. Inf. Comput. 137(1): 69-101 (1997) | |
10 | Yves Lafont: The Finite Model Property for Various Fragments of Linear Logic. J. Symb. Log. 62(4): 1202-1208 (1997) | |
1996 | ||
9 | Yves Lafont, Andre Scedrov: The Undecidability of Second Order Multiplicative Linear Logic. Inf. Comput. 125(1): 46-51 (1996) | |
8 | Yves Lafont: The Undecidability of Second Order Linear Logic Without Exponentials. J. Symb. Log. 61(2): 541-548 (1996) | |
1993 | ||
7 | Yves Lafont: Equational Reasoning with Two-Dimensional Diagrams. Term Rewriting 1993: 170-195 | |
1991 | ||
6 | Yves Lafont, Thomas Streicher: Games Semantics for Linear Logic LICS 1991: 43-50 | |
5 | Yves Lafont, Alain Prouté: Church-Rosser Property and Homology of Monoids. Mathematical Structures in Computer Science 1(3): 297-326 (1991) | |
1990 | ||
4 | Yves Lafont: Interaction Nets. POPL 1990: 95-108 | |
1988 | ||
3 | Yves Lafont: The Linear Abstract Machine. Theor. Comput. Sci. 59: 157-180 (1988) | |
2 | Yves Lafont: The Linear Abstract Machine (Corrigenda). Theor. Comput. Sci. 62(3): 327-328 (1988) | |
1987 | ||
1 | Jean-Yves Girard, Yves Lafont: Linear Logic and Lazy Computation. TAPSOFT, Vol.2 1987: 52-66 |
1 | Thomas Ehrhard | [13] |
2 | Jean-Yves Girard | [1] |
3 | Alain Prouté | [5] |
4 | Pierre Rannou | [16] |
5 | Laurent Regnier | [13] |
6 | Andre Scedrov | [9] |
7 | Thomas Streicher | [6] |