scholarly journals Selection and use of general-purpose programming languages

Author(s):  
John V Cugini
2021 ◽  
Vol 31 ◽  
Author(s):  
BHARGAV SHIVKUMAR ◽  
JEFFREY MURPHY ◽  
LUKASZ ZIAREK

Abstract There is a growing interest in leveraging functional programming languages in real-time and embedded contexts. Functional languages are appealing as many are strictly typed, amenable to formal methods, have limited mutation, and have simple but powerful concurrency control mechanisms. Although there have been many recent proposals for specialized domain-specific languages for embedded and real-time systems, there has been relatively little progress on adapting more general purpose functional languages for programming embedded and real-time systems. In this paper, we present our current work on leveraging Standard ML (SML) in the embedded and real-time domains. Specifically, we detail our experiences in modifying MLton, a whole-program optimizing compiler for SML, for use in such contexts. We focus primarily on the language runtime, reworking the threading subsystem, object model, and garbage collector. We provide preliminary results over a radar-based aircraft collision detector ported to SML.


Author(s):  
Liliana María Favre

MDA requires the ability to understand different languages such as general purpose languages, domain specific languages, modeling languages or programming languages. An underlying principle of MDA for integrating semantically in a unified and interoperable way such languages is using metamodeling techniques.


2006 ◽  
Vol 16 (6) ◽  
pp. 793-811 ◽  
Author(s):  
ALEX POTANIN ◽  
JAMES NOBLE ◽  
DAVE CLARKE ◽  
ROBERT BIDDLE

Existing approaches to object encapsulation either rely on ad hoc syntactic restrictions or require the use of specialised type systems. Syntactic restrictions are difficult to scale and to prove correct, while specialised type systems require extensive changes to programming languages. We demonstrate that confinement can be enforced cheaply in Featherweight Generic Java, with no essential change to the underlying language or type system. This result demonstrates that polymorphic type parameters can simultaneously act as ownership parameters and should facilitate the adoption of confinement and ownership type systems in general-purpose programming languages.


Author(s):  
Juan D. Lara ◽  
Esther Guerra ◽  
Hans Vangheluwe

Since the beginning of computer science more than 50 years ago, software engineers have sought techniques resulting in higher levels of quality and productivity. Some of these efforts have concentrated in increasing the level of abstraction in programming languages (from assembler to structured languages to object-oriented languages). In the last few years, we have witnessed an increasing focus on development based on high-level, graphical models. They are used not only as a means to documentthe analysis and design activities, but also as the actual “implementation” of the application, as well as for automatic analysis, code, and test case generation. The notations used to describe the models can be standard and general purpose (for example, UML) or tightly customized for the application domain. Code generation for the full application is only accomplished for specific, well-understood application domains. A key initiative in this direction is OMG’s Model-Driven Architecture (MDA), where models are progressively transformed until executable code is obtained. In this chapter, we give an overview of these technologies and propose ideas following this line (concerning metamodeling and the use of visual languages for the specification of model transformation, model simulation, analysis and code generation), and examine the impact of model-based techniques in the development process.


Author(s):  
Didier Verna

Out of a concern for focus and concision, domain-specific languages (DSLs) are usually very different from general purpose programming languages (GPLs), both at the syntactic and the semantic levels. One approach to DSL implementation is to write a full language infrastructure, including parser, interpreter, or even compiler. Another approach however, is to ground the DSL into an extensible GPL, giving you control over its own syntax and semantics. The DSL may then be designed merely as an extension to the original GPL, and its implementation may boil down to expressing only the differences with it. The task of DSL implementation is hence considerably eased. The purpose of this chapter is to provide a tour of the features that make a GPL extensible, and to demonstrate how, in this context, the distinction between DSL and GPL can blur, sometimes to the point of complete disappearance.


Author(s):  
Alexander Garcia D. ◽  
Andres Navarro C. ◽  
Adriana Arteaga A. ◽  
Fabio G. Guerrero ◽  
Enrique Stevens-Navarro

Computer simulation is an important tool for the study and analysis of communication networks. In the case of simulation of Vertical Handoff Algorithms (VHAs) for heterogeneous wireless networks there are two approaches: using a network simulator or using general purpose programming languages. The objective of this chapter is to present and compare both approaches, by means of two study cases. The first case considers the use of network simulator NCTUns (National Chiao Tung University Network Simulator), while the second case considers the use of MATLAB.


2019 ◽  
Vol 26 ◽  
pp. 29-35
Author(s):  
I.A. TREGUBOVA ◽  

Progress in hardware and software development is impressively fast. The main reason of computer graphics fast improvement is a full experience that can be reached though visual representation of our world. Therefore, the most interesting problem of it is a realistic image with high quality and resolution, which often requires procedural graphics generation. The article analyzes simplicity of a fractal and mathematics abstraction. Mathematics describes not only accuracy and logic but also beauty of the Universe. Mountains, clouds, trees, cells do not fit into the world of Euclidean geometry. They cannot be described by its methods. But fractals and fractal geometry solve that problem. Fractals are fairly simple equations on a sheet of paper with bright, unusual images, and, above all, they explain things. Fractal is a figure in the space, which consists of statistical character as the whole. It is self-similar, and therefore looks ‘roughly’ same and does not depend on its scale. So, any complex object can be called a fractal, if it has the same shape, as the parts it consists of. Fractal is abstract, and it helps to translate any algebraic problem into geometric, where solution is always obvious. A lot of researches in the field of fractal graphics has been carried out, but there are still issues that deserve considerable attention and more perfect solutions. The main purpose of the work is codes development with object-oriented programming languages for fractal graphics rendering. The article analyzes simplicity of a fractal and mathematics abstraction. Procedural generation was described as a method of algorithmic data generation for 3D models and textures creation. Code was written with general-purpose programming language Python, which renders step by step creation of fractal composition and variations of fractal images. Fractal generation used for modeling is part of realism in computer graphics In summary, procedural generation is very important for video games, as it can be used to automatically create large amount of game content. The random generation of natural looking landscapes is based on geometric computer generated images Created compositions can be used in computer science for image compression, in medicine for the study of the cellular level of organs, etc.


Author(s):  
Renato Maia Matarazzo Orsino ◽  
Tarcisio Antonio Hess-Coelho

Over the past half-century, the increasing use of computational tools for mathematical modelling and simulation was responsible for significant advances in the area of Multibody System Dynamics. However, there is still a high dependence on the use of proprietary software in this area. Noticing that most of the complex multibody systems share many components and subsystems, this paper aims to propose a modular modelling methodology in which the starting points are some already known mathematical models of subsystems and the corresponding descriptions of the constraints existing among them. The proposed algorithm is based on the computation of some orthogonal complements of Jacobian matrices, derived from the constraint equations among the subsystems, leading to a minimal system of equations without requiring the use of undetermined multipliers or generalized constraint forces. Such an algorithm can be implemented using general-purpose (eventually open source) software packages or programming languages. Another remarkable advantage of this methodology stems from the fact that even when different (Classical or Analytical Mechanics) formalisms have been used in the modelling of subsystems, it is still possible to use the proposed algorithm. Well-known examples and a rederivation of the Whipple bicycle model are used to illustrate applications of this novel methodology.


Sign in / Sign up

Export Citation Format

Share Document