{"title":"Groupoids and computer arithmetic","authors":"H. Garner, N. Foo, L. Hsieh","doi":"10.1109/ARITH.1972.6153886","DOIUrl":null,"url":null,"abstract":"Overflow detection and overflow recovery imposed no particular requirements on the structure of (X, X 1 < X 1 , f x ). In particular, if f is associative and commutative, overflow recovery is obtainable even if f x is neither associative or commutative.","PeriodicalId":6526,"journal":{"name":"2015 IEEE 22nd Symposium on Computer Arithmetic","volume":"83 1","pages":"1-14"},"PeriodicalIF":0.0000,"publicationDate":"1972-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 22nd Symposium on Computer Arithmetic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.1972.6153886","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Overflow detection and overflow recovery imposed no particular requirements on the structure of (X, X 1 < X 1 , f x ). In particular, if f is associative and commutative, overflow recovery is obtainable even if f x is neither associative or commutative.