Matching with multiplication and exponentiation (extended abstract)

• Autores: Bernard Lang
• Localización: Mathematical structures in computer science, ISSN 0960-1295, Vol. 15, Nº 5, 2005, págs. 959-968
• Idioma: inglés
• DOI: 10.1017/s0960129505004883
• Texto completo no disponible (Saber más ...)
• Resumen

  • We develop a matching algorithm for an equational theory with multiplication, exponentiation and a unit element. The algorithm is proved consistent, complete and minimal using techniques based on initial algebras.