| Автор | LANG, BERNARD |
| Дата выпуска | 2005 |
| dc.description | 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. |
| Издатель | Cambridge University Press |
| Название | Matching with multiplication and exponentiation (extended abstract)Written May 1978 – see the historical note at the end of the paper. |
| DOI | 10.1017/S0960129505004883 |
| Electronic ISSN | 1469-8072 |
| Print ISSN | 0960-1295 |
| Журнал | Mathematical Structures in Computer Science |
| Том | 15 |
| Первая страница | 959 |
| Последняя страница | 968 |
| Аффилиация | LANG BERNARD; Domaine de Voluceau |
| Выпуск | 5 |
