Algebra and Geometry of Rewriting

We present various results of the last twenty years converging towards a homotopical theory of computation. This new theory is based on two crucial notions : polygraphs (introduced by Albert Burroni) and polygraphic resolutions (introduced by François Métayer). There are two motivations for such a theory: • providing invariants of computational systems to study those systems and prove properties about them; • finding new methods to make computations in algebraic structures coming from geometry or topology. This means that this theory should be relevant for mathematicians as well as for theoretical computer scientists, since both may find useful tools or concepts for their own domain coming from the other one. ∗This work has been partly supported by project GEOCAL (Géométrie du Calcul, ACI Nouvelles Interfaces des Mathématiques) and by project INVAL (Invariants algébriques des systèmes informatiques, ANR). †Address: IML - 163 avenue de Luminy, Case 907 - 13288 Marseill...

• Type: Journal
• Year: 2007
• Where: ACS
• Authors: Yves Lafont
• Keywords: ACS 2007, Crucial Notions, Distributed And Parallel Computing, Homotopical Theory, Theory