No Cover Image

Journal article 181 views

Eager Term Rewriting For The Fracterm Calculus Of Common Meadows

Jan A Bergstra, John Tucker Orcid Logo

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

Swansea University Author: John Tucker Orcid Logo

Full text not available from this repository: check for access using links below.

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) 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!
first_indexed 2023-12-06T23:37:25Z
last_indexed 2023-12-06T23:37:25Z
id cronfa65232
recordtype SURis
fullrecord <?xml version="1.0" encoding="utf-8"?><rfc1807 xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xsd="http://www.w3.org/2001/XMLSchema"><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 ⁠. 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/><publishedDay>1</publishedDay><publishedMonth>11</publishedMonth><publishedYear>2023</publishedYear><publishedDate>2023-11-01</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/><funders/><projectreference/><lastEdited>2024-07-21T00:45:56.8148087</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></authors><documents/><OutputDurs/></rfc1807>
spelling 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 1 11 2023 2023-11-01 10.1093/comjnl/bxad106 COLLEGE NANME Mathematics and Computer Science School COLLEGE CODE MACS Swansea University 2024-07-21T00:45:56.8148087 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
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
format Journal article
container_title The Computer Journal
container_volume 67
container_issue 5
container_start_page 1866
publishDate 2023
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 0
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 2023-11-01T00:45:57Z
_version_ 1805143672238374912
score 10.612244

Similar Items