For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

Swansea University

Return to search Previous output Next output
Output 0 of 0 in the submission
Article title

Meadows and the equational specification of division

Type
D - Journal article
Title of journal
Theoretical Computer Science
Article number
-
Volume number
410
Issue number
12-13
First page of article
1261
ISSN of journal
0304-3975
Year of publication
2009
URL
-
Number of additional authors
2
Additional information

<11> Division 1/x is a partial operation because it is not continuous at 0. This is the first algebraic theory of total division in which 1/0=0, a convention in software tools (e.g., in verification by Harrison (Intel)). The new notion of meadow solves problems beyond the scope of classical field theory: it specifies division using equations; it classifies embeddings into affine spaces. The paper led to 9 further papers. For example, safe error recovery methods for meadows are used by Burgess to study system rollback in operating systems (J Logic Algebraic Programming 80 (2011) 427–443).

Interdisciplinary
-
Cross-referral requested
-
Research group
A - Theoretical Computer Science
Citation count
7
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-