Hostname: page-component-6898cfcb55-w5hgh Total loading time: 0 Render date: 2026-11-11T10:50:47.457Z Has data issue: false hasContentIssue false
  • English
  • Français

Matching with multiplication and exponentiation (extended abstract)

Published online by Cambridge University Press:  04 October 2005

BERNARD LANG
BERNARD LANG
Affiliation:
IRIA – Laboria, Domaine de Voluceau, Rocquencourt, 78150 LE CHESNAY, FranceThe current coordinates of the author are: INRIA, B.P. 105, 78153 Le Chesnay CEDEX, France – Bernard.Lang@inria.fr
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 15 , Issue 5 , October 2005, pp. 959 - 968
Copyright
2005 Cambridge University Press

Footnotes

Written May 1978 – see the historical note at the end of the paper.