Journal article 181 views
Eager Term Rewriting For The Fracterm Calculus Of Common Meadows
Jan A Bergstra,
John Tucker 
The Computer Journal, Volume: 67, Issue: 5, Pages: 1866 - 1871
Swansea University Author:
John Tucker
Full text not available from this repository: check for access using links below.
DOI (Published version): 10.1093/comjnl/bxad106
Abstract
Eager equality is a novel semantics for equality in the presence of partial operations. We consider term rewriting for eager equality for arithmetic in which division is a partial operator. We use common meadows which are essentially fields that contain an absorptive element . The idea is that term...
| Published in: | The Computer Journal |
|---|---|
| ISSN: | 0010-4620 1460-2067 |
| Published: |
Oxford University Press (OUP)
2023
|
| Online Access: |
Check full text
|
| URI: | https://cronfa.swan.ac.uk/Record/cronfa65232 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract: |
Eager equality is a novel semantics for equality in the presence of partial operations. We consider term rewriting for eager equality for arithmetic in which division is a partial operator. We use common meadows which are essentially fields that contain an absorptive element . The idea is that term rewriting is supposed to be semantics preserving for non- terms only. We show soundness and adequacy results for eager term rewriting w.r.t. the class of all common meadows. However, we show that an eager term rewrite system which is complete for common meadows of rational numbers is not easy to obtain, if it exists at all. |
|---|---|
| College: |
Faculty of Science and Engineering |
| Issue: |
5 |
| Start Page: |
1866 |
| End Page: |
1871 |