Objects of Alternative Set Theory in Set@l Programming Language
| Autor: | Andrey K. Melnikov, I. V. Pisarenko, Ilya I. Levin, Alexey I. Dordopulo |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Source code
Computer science business.industry Programming language media_common.quotation_subject Alternative set theory computer.software_genre Porting symbols.namesake Jacobi eigenvalue algorithm Software symbols Graph (abstract data type) Semiset Computational problem business computer media_common |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783030256357 PaCT |
| DOI: | 10.1007/978-3-030-25636-4_3 |
| Popis: | Software porting between high-performance computer systems with different architectures requires a major code revision due to the architectural limitation of available programming languages. To solve the problem, we have proposed an architecture-independent Set@l programming language based on the principles of set-theoretic codeview and aspect-oriented programming. In Set@l, a program consists of a source code, which describes an information graph of a computational problem, and aspects, which adapt an algorithm to the architecture and configuration of a computer system. If an algorithm remains unchanged during its architectural adaptation, calculations and their parallelizing are described within the Cantor-Bolzano set theory. In the case of algorithm modification, some collections are indefinite, and we can not treat them as traditional sets with sharply defined elements. To describe indefinite objects, Set@l applies the alternative set theory developed by P. Vopenka. If collection has indefinite type and structure at some level of abstraction, it belongs to a “class” type. In contrast to a class, the indefiniteness of a semiset is an essential and inalienable attribute. The application of classes, sets and semisets allows to describe various methods of the algorithm implementation and parallelizing as an entire Set@l program. In this paper the Jacobi algorithm for the solution of linear equation systems is considered as an example of the utilization of classes and semisets. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|