{"title":"有理数抽象数据类型的最一般代数规范","authors":"J. Bergstra","doi":"10.7561/SACS.2020.1.1","DOIUrl":null,"url":null,"abstract":"The notion of a most general algebraic specification of an arithmetical datatype of characteristic zero is introduced.Three examples of such specifications are given. A preference is formulated for a specification by means of infinitely many equations which can be presented via a finite number of so-called schematic equations phrased in terms of an infinite signature. On the basis of the latter specification three topics are discussed: (i) fracterm decomposition operators and the numerator paradox, (ii) foundational specifications of arithmetical datatypes, and (iii) poly-infix operations.","PeriodicalId":394919,"journal":{"name":"Sci. Ann. Comput. Sci.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Most General Algebraic Specifications for an Abstract Datatype of Rational Numbers\",\"authors\":\"J. Bergstra\",\"doi\":\"10.7561/SACS.2020.1.1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The notion of a most general algebraic specification of an arithmetical datatype of characteristic zero is introduced.Three examples of such specifications are given. A preference is formulated for a specification by means of infinitely many equations which can be presented via a finite number of so-called schematic equations phrased in terms of an infinite signature. On the basis of the latter specification three topics are discussed: (i) fracterm decomposition operators and the numerator paradox, (ii) foundational specifications of arithmetical datatypes, and (iii) poly-infix operations.\",\"PeriodicalId\":394919,\"journal\":{\"name\":\"Sci. Ann. Comput. Sci.\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-08-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sci. Ann. Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.7561/SACS.2020.1.1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sci. Ann. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7561/SACS.2020.1.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Most General Algebraic Specifications for an Abstract Datatype of Rational Numbers
The notion of a most general algebraic specification of an arithmetical datatype of characteristic zero is introduced.Three examples of such specifications are given. A preference is formulated for a specification by means of infinitely many equations which can be presented via a finite number of so-called schematic equations phrased in terms of an infinite signature. On the basis of the latter specification three topics are discussed: (i) fracterm decomposition operators and the numerator paradox, (ii) foundational specifications of arithmetical datatypes, and (iii) poly-infix operations.