{"title":"Intensionality, compositionality, and nominativity in information system development","authors":"M. Nikitchenko","doi":"10.1109/INTELCIS.2015.7397186","DOIUrl":null,"url":null,"abstract":"Summary form only given. Process of information system development consists of several phases including, in particular, system analysis, specification, design, and implementation. Each of these phases is based on some abstractions that can be roughly divided into two groups of general and specific abstractions respectively. In this talk we address to such general abstractions as intensionality, compositionality, and nominativity. Intensionality is understood in the traditional sense as a counterpart to extensionality that together complete each other and define the main aspects of notions in their integrity. Compositionality means that a system is constructed of smaller subsystems with the help of special construction operations called compositions. Nominativity emphasizes the importance of naming relations for system aspects description. We analyze and illustrate the use of the above mentioned abstractions in different phases of system development. Considering conventional mathematical formalisms we admit that they are based on the extensionality principle that restricts and complicates usage of such formalisms in system development. Therefore we construct formal mathematical structures based on the principles of intensionality, compositionality, and nominativity. These structures can be considered generalizations of traditional notions of algebras and logics for classes of \"dynamic\" data and functions. Introduction of such formalisms permits us to define also a special kind of intensionalized computability that better reflects specifics of executable components of information systems. We compare the constructed formalisms with the existing ones and demonstrate that they a rather expressive and more adequate for information system development.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"34 1","pages":"1-2"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INTELCIS.2015.7397186","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Summary form only given. Process of information system development consists of several phases including, in particular, system analysis, specification, design, and implementation. Each of these phases is based on some abstractions that can be roughly divided into two groups of general and specific abstractions respectively. In this talk we address to such general abstractions as intensionality, compositionality, and nominativity. Intensionality is understood in the traditional sense as a counterpart to extensionality that together complete each other and define the main aspects of notions in their integrity. Compositionality means that a system is constructed of smaller subsystems with the help of special construction operations called compositions. Nominativity emphasizes the importance of naming relations for system aspects description. We analyze and illustrate the use of the above mentioned abstractions in different phases of system development. Considering conventional mathematical formalisms we admit that they are based on the extensionality principle that restricts and complicates usage of such formalisms in system development. Therefore we construct formal mathematical structures based on the principles of intensionality, compositionality, and nominativity. These structures can be considered generalizations of traditional notions of algebras and logics for classes of "dynamic" data and functions. Introduction of such formalisms permits us to define also a special kind of intensionalized computability that better reflects specifics of executable components of information systems. We compare the constructed formalisms with the existing ones and demonstrate that they a rather expressive and more adequate for information system development.