Hostname: page-component-745bb68f8f-hvd4g Total loading time: 0 Render date: 2025-01-31T01:44:16.375Z 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, France
The current coordinates of the author are: INRIA, B.P. 105, 78153 Le Chesnay CEDEX, France – Bernard.Lang@inria.fr
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

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