No Cover Image

Journal article 681 views 55 downloads

Eager Term Rewriting For The Fracterm Calculus Of Common Meadows

Jan A Bergstra, John Tucker Orcid Logo, John V Tucker

The Computer Journal, Volume: 67, Issue: 5, Pages: 1866 - 1871

Swansea University Author: John Tucker Orcid Logo

  • 65232.VoR.pdf

    PDF | Version of Record

    ©The Author(s) 2023. This is an Open Access article distributed under the terms of the Creative Commons Attribution License.

    Download (378.01KB)

Check full text

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...

Full description

Published in: The Computer Journal
ISSN: 0010-4620 1460-2067
Published: Oxford University Press (OUP) 2024
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa65232
first_indexed 2023-12-06T23:37:25Z
last_indexed 2025-07-30T09:51:00Z
id cronfa65232
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2025-07-29T13:00:49.9097141</datestamp><bib-version>v2</bib-version><id>65232</id><entry>2023-12-06</entry><title>Eager Term Rewriting For The Fracterm Calculus Of Common Meadows</title><swanseaauthors><author><sid>431b3060563ed44cc68c7056ece2f85e</sid><ORCID>0000-0003-4689-8760</ORCID><firstname>John</firstname><surname>Tucker</surname><name>John Tucker</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2023-12-06</date><deptcode>MACS</deptcode><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 &#x2060;. 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.</abstract><type>Journal Article</type><journal>The Computer Journal</journal><volume>67</volume><journalNumber>5</journalNumber><paginationStart>1866</paginationStart><paginationEnd>1871</paginationEnd><publisher>Oxford University Press (OUP)</publisher><placeOfPublication/><isbnPrint/><isbnElectronic/><issnPrint>0010-4620</issnPrint><issnElectronic>1460-2067</issnElectronic><keywords>Eager equality; term rewriting; common meadow; fracterm calculus</keywords><publishedDay>22</publishedDay><publishedMonth>6</publishedMonth><publishedYear>2024</publishedYear><publishedDate>2024-06-22</publishedDate><doi>10.1093/comjnl/bxad106</doi><url/><notes/><college>COLLEGE NANME</college><department>Mathematics and Computer Science School</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>MACS</DepartmentCode><institution>Swansea University</institution><apcterm>SU Library paid the OA fee (TA Institutional Deal)</apcterm><funders/><projectreference/><lastEdited>2025-07-29T13:00:49.9097141</lastEdited><Created>2023-12-06T23:30:13.2840687</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Jan A</firstname><surname>Bergstra</surname><order>1</order></author><author><firstname>John</firstname><surname>Tucker</surname><orcid>0000-0003-4689-8760</orcid><order>2</order></author><author><firstname>John V</firstname><surname>Tucker</surname><order>3</order></author></authors><documents><document><filename>65232__34854__5c5d292e6e2a4e6fa049ed287d98f5b9.pdf</filename><originalFilename>65232.VoR.pdf</originalFilename><uploaded>2025-07-28T16:31:52.0975241</uploaded><type>Output</type><contentLength>387084</contentLength><contentType>application/pdf</contentType><version>Version of Record</version><cronfaStatus>true</cronfaStatus><documentNotes>&#xA9;The Author(s) 2023. This is an Open Access article distributed under the terms of the Creative Commons Attribution License.</documentNotes><copyrightCorrect>true</copyrightCorrect><language>eng</language><licence>https://creativecommons.org/licenses/by/4.0/</licence></document></documents><OutputDurs/></rfc1807>
spelling 2025-07-29T13:00:49.9097141 v2 65232 2023-12-06 Eager Term Rewriting For The Fracterm Calculus Of Common Meadows 431b3060563ed44cc68c7056ece2f85e 0000-0003-4689-8760 John Tucker John Tucker true false 2023-12-06 MACS 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. Journal Article The Computer Journal 67 5 1866 1871 Oxford University Press (OUP) 0010-4620 1460-2067 Eager equality; term rewriting; common meadow; fracterm calculus 22 6 2024 2024-06-22 10.1093/comjnl/bxad106 COLLEGE NANME Mathematics and Computer Science School COLLEGE CODE MACS Swansea University SU Library paid the OA fee (TA Institutional Deal) 2025-07-29T13:00:49.9097141 2023-12-06T23:30:13.2840687 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Jan A Bergstra 1 John Tucker 0000-0003-4689-8760 2 John V Tucker 3 65232__34854__5c5d292e6e2a4e6fa049ed287d98f5b9.pdf 65232.VoR.pdf 2025-07-28T16:31:52.0975241 Output 387084 application/pdf Version of Record true ©The Author(s) 2023. This is an Open Access article distributed under the terms of the Creative Commons Attribution License. true eng https://creativecommons.org/licenses/by/4.0/
title Eager Term Rewriting For The Fracterm Calculus Of Common Meadows
spellingShingle Eager Term Rewriting For The Fracterm Calculus Of Common Meadows
John Tucker
title_short Eager Term Rewriting For The Fracterm Calculus Of Common Meadows
title_full Eager Term Rewriting For The Fracterm Calculus Of Common Meadows
title_fullStr Eager Term Rewriting For The Fracterm Calculus Of Common Meadows
title_full_unstemmed Eager Term Rewriting For The Fracterm Calculus Of Common Meadows
title_sort Eager Term Rewriting For The Fracterm Calculus Of Common Meadows
author_id_str_mv 431b3060563ed44cc68c7056ece2f85e
author_id_fullname_str_mv 431b3060563ed44cc68c7056ece2f85e_***_John Tucker
author John Tucker
author2 Jan A Bergstra
John Tucker
John V Tucker
format Journal article
container_title The Computer Journal
container_volume 67
container_issue 5
container_start_page 1866
publishDate 2024
institution Swansea University
issn 0010-4620
1460-2067
doi_str_mv 10.1093/comjnl/bxad106
publisher Oxford University Press (OUP)
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
document_store_str 1
active_str 0
description 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.
published_date 2024-06-22T05:17:10Z
_version_ 1851097172043366400
score 11.089386

Similar Items