Year-end Sale % OFF 
Abstract
The article is devoted to the choice of a clear and concise form for presenting the results of analise and comparing programming languages and systems, convenient for assessing the expressive power of languages and the complexity of implementing systems. The formalization is adapted to the paradigm analysis of the definitions of programming languages and the selection of practical criteria for decomposition of programs. The semantic decomposition of the definitions of languages and systems as part of the analysis of programming paradigms was chosen as the main ap-proach. Such a choice makes it possible to single out autonomously developed typical program components that can be adapted to the design of various information systems. Many works on methods for developing software systems depend on the practicality of approaches to decomposition of programs debugged using programming systems. The solution to this problem is useful when studying programming methods, studying the history of programming languages, for comparing programming paradigms, the potential of used circuits and models, assessing the novelty level of created programming languages, and also when choosing criteria for program decomposition. In addition, their existence allows us to form a teaching methodology for developing the components of information systems. Along the way, the distance in conceptual complexity between programming and programming system development is shown.
Highlights
Such a choice makes it possible to single out autonomously developed typical program components that can be adapted to the design of various information systems
Many works on methods for developing software systems depend on the practicality of approaches to decomposition of programs debugged using programming systems
Примерно так можно формализовать библиотечные модули в системы программирования (СП) и классы объектов в ООП до тех пор, пока при реализации языков программирования (ЯП) не возникает необходимость использовать разные модели вычислений по одним и тем же формулам
Summary
В качестве отправной точки для представления решений по декомпозиции программ можно принять классическое понятие «алгебраическая система» [1]: алгебраическая система – это , где A – основное множество значений, F – конечный набор операций над множеством A. Лавров предложил понятие «семантическая система», расширяющее понятие «алгебраическая система» заданием явного правила применения функций к значениям [2]: семантическая система – это , где V – основное множество значений, F – конечный набор функций, возможно принадлежащих основному множеству, R – правило применения функций к значениям, возможно входящее в набор функций. Большинство ЯП поддерживает разные варианты утончения понятия «семантическая система», например, где F – конечный набор функций, не принадлежащих основному множеству, R – правило применения функций к значениям, не входящее в набор функций.
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
