Topic
Applicative computing systems
About: Applicative computing systems is a research topic. Over the lifetime, 3 publications have been published within this topic receiving 2513 citations.
Papers
IBM1
TL;DR: A new class of computing systems uses the functional programming style both in its programming language and in its state transition rules; these systems have semantics loosely coupled to states—only one state transition occurs per major computation.
Abstract: Conventional programming languages are growing ever more enormous, but not stronger. Inherent defects at the most basic level cause them to be both fat and weak: their primitive word-at-a-time style of programming inherited from their common ancestor—the von Neumann computer, their close coupling of semantics to state transitions, their division of programming into a world of expressions and a world of statements, their inability to effectively use powerful combining forms for building new programs from existing ones, and their lack of useful mathematical properties for reasoning about programs.An alternative functional style of programming is founded on the use of combining forms for creating programs. Functional programs deal with structured data, are often nonrepetitive and nonrecursive, are hierarchically constructed, do not name their arguments, and do not require the complex machinery of procedure declarations to become generally applicable. Combining forms can use high level programs to build still higher level ones in a style not possible in conventional languages.Associated with the functional style of programming is an algebra of programs whose variables range over programs and whose operations are combining forms. This algebra can be used to transform programs and to solve equations whose “unknowns” are programs in much the same way one transforms equations in high school algebra. These transformations are given by algebraic laws and are carried out in the same language in which programs are written. Combining forms are chosen not only for their programming power but also for the power of their associated algebraic laws. General theorems of the algebra give the detailed behavior and termination conditions for large classes of programs.A new class of computing systems uses the functional programming style both in its programming language and in its state transition rules. Unlike von Neumann languages, these systems have semantics loosely coupled to states—only one state transition occurs per major computation.
2,887 citations
TL;DR: The paper considers the problem of building of the transformable object-relation mapping and offers to receive the decision by a semantic method in case of which the formal models of object system and relational system are considered and their interpretations are set.
6 citations
6 Sep 2018
TL;DR: The paper analyzed the possibilities of taking into account the specifics of the application of information systems when developing them basing on the notion of the “situation of using”, and introduced the concept of situationally determined evaluation.
Abstract: The paper considers special tasks of data domains modeling. It analyzed the possibilities of taking into account the specifics of the application of information systems when developing them basing on the notion of the “situation of using”. The notion of “situationally determined evaluation” is introduced to consider situations of use within the framework of applicative computing systems. The approaches to the development of situationally determined evaluation tools and some principles for developing such tools are considered, especially in connection with the need to include active agents in the data domain model. The examples of situationally determined evaluation in various data domains are given.
1 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2018 | 2 |
| 1978 | 1 |