Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP mark 2

M. Randall Holmes

doi:10.1007/3-540-59200-8_78

Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP mark 2

M. Randall Holmes

Mathematics Department

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Original language	English
Title of host publication	Rewriting Techniques and Applications - 6th Intemational Conference, RTA 1995, Proceedings
Editors	Jieh Hsiang
Publisher	Springer Verlag
Pages	432-437
Number of pages	6
ISBN (Print)	9783540592006
DOIs	https://doi.org/10.1007/3-540-59200-8_78
State	Published - 1995
Event	6th International Conference on Rewriting Techniques and Applications, RTA 1995 - Kaiserslautern, Germany Duration: 5 Apr 1995 → 7 Apr 1995

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	914
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	6th International Conference on Rewriting Techniques and Applications, RTA 1995
Country/Territory	Germany
City	Kaiserslautern
Period	5/04/95 → 7/04/95

Access to Document

10.1007/3-540-59200-8_78

Cite this

Holmes, M. R. (1995). Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP mark 2. In J. Hsiang (Ed.), Rewriting Techniques and Applications - 6th Intemational Conference, RTA 1995, Proceedings (pp. 432-437). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 914). Springer Verlag. https://doi.org/10.1007/3-540-59200-8_78

Holmes, M. Randall. / Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP mark 2. Rewriting Techniques and Applications - 6th Intemational Conference, RTA 1995, Proceedings. editor / Jieh Hsiang. Springer Verlag, 1995. pp. 432-437 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{3b8c203619ec4075b7f2303348191fb9,

title = "Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP mark 2",

author = "Holmes, {M. Randall}",

year = "1995",

doi = "10.1007/3-540-59200-8_78",

language = "English",

isbn = "9783540592006",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "432--437",

editor = "Jieh Hsiang",

booktitle = "Rewriting Techniques and Applications - 6th Intemational Conference, RTA 1995, Proceedings",

address = "Germany",

note = "6th International Conference on Rewriting Techniques and Applications, RTA 1995 ; Conference date: 05-04-1995 Through 07-04-1995",

}

Holmes, MR 1995, Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP mark 2. in J Hsiang (ed.), Rewriting Techniques and Applications - 6th Intemational Conference, RTA 1995, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 914, Springer Verlag, pp. 432-437, 6th International Conference on Rewriting Techniques and Applications, RTA 1995, Kaiserslautern, Germany, 5/04/95. https://doi.org/10.1007/3-540-59200-8_78

Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP mark 2. / Holmes, M. Randall.
Rewriting Techniques and Applications - 6th Intemational Conference, RTA 1995, Proceedings. ed. / Jieh Hsiang. Springer Verlag, 1995. p. 432-437 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 914).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP mark 2

AU - Holmes, M. Randall

PY - 1995

Y1 - 1995

UR - http://www.scopus.com/inward/record.url?scp=84955576297&partnerID=8YFLogxK

U2 - 10.1007/3-540-59200-8_78

DO - 10.1007/3-540-59200-8_78

M3 - Conference contribution

AN - SCOPUS:84955576297

SN - 9783540592006

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 432

EP - 437

BT - Rewriting Techniques and Applications - 6th Intemational Conference, RTA 1995, Proceedings

A2 - Hsiang, Jieh

PB - Springer Verlag

T2 - 6th International Conference on Rewriting Techniques and Applications, RTA 1995

Y2 - 5 April 1995 through 7 April 1995

ER -

Holmes MR. Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP mark 2. In Hsiang J, editor, Rewriting Techniques and Applications - 6th Intemational Conference, RTA 1995, Proceedings. Springer Verlag. 1995. p. 432-437. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-59200-8_78

Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP mark 2

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this