Home Members Articles Meetings

Articles

  1. Programs as polygraphs: computability and complexity
    Guillaume Bonfante and Yves Guiraud
    Logical Methods in Computer Science (in revision), 32 pages, December 2006.
  2. Intensional properties of polygraphs
    Guillaume Bonfante and Yves Guiraud
    Termgraph, 11 pages, January 2007.
  3. Towards a homotopy theory of process algebra (pdf)
    Philippe Gaucher
    Homology, Homotopy and Applications vol. 10 (1):p.353-388, 2008.
  4. Globular realization and cubical underlying homotopy type of time flow of process algebra (pdf)
    Philippe Gaucher
    New-York Journal of Mathematics 14 (2008), 101-137
  5. Homotopical interpretation of globular complex by multipointed d-space (pdf)
    Philippe Gaucher
    preprint
  6. Homotopical equivalence of combinatorial and categorical semantics of process algebra (pdf)
    Philippe Gaucher
    preprint
  7. Abstract homotopical methods for theoretical computer science (pdf)
    Philippe Gaucher
    preprint (chapter of a book)
  8. Combinatorics of labelling in higher dimensional automata
    Philippe Gaucher
    preprint
  9. A practical application of geometric semantics to the static analysis of concurrent programs
    Eric Goubault and Emmanuel Haucourt
    Proceeding of CONCUR'05, presented in San Francisco, august 2005.
  10. Components of the Fundamental Category II
    Eric Goubault and Emmanuel Haucourt
    Journal of Applied Categorical Structures, 2007. To appear.
  11. Polygraphs for termination of left-linear term rewriting systems
    Yves Guiraud
    preprint, 15 pages, February 2007.
  12. Categories of components and Loop-free categories
    Emmanuel Haucourt
    Theory and Applications of Categories, vol. 16 no. 27, 2006.
  13. Algebra and geometry of rewriting
    Yves Lafont
    to appear in Applied Categorical Structures.
  14. The word problem
    Yves Lafont
    preprint (chapter of a book).
  15. Polygraphic resolutions and homology of monoids
    Yves Lafont and François Métayer
    submitted 2006.
  16. Asynchronous Games: Innocence without Alternation
    Paul-André Melliès and Samuel Mimram
    proceedings of CONCUR'07.
  17. Cofibrant complexes are free
    François Métayer
    submitted and presented in Strasbourg INVAL 2007.