Exploring Programming Paradigms

Author(s):  
Jesse Feiler
Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1255
Author(s):  
Lukas Hapl ◽  
Hashim Habiballa

This article introduces the possible usage of the developed programming discourse that can be used to support training in the digital logic area. The discourse merges several programming paradigms into one solution. The intended learners are secondary school students focused on digital system programming. The main intent is to find out whether digital logic curriculum based on Digital Circuits Based Logical Programming (DCBLP) inheritance has positive impact on the students and the way they explore the digital logic itself. Students’ cognitive and affective areas are in the scope of this preliminary research and questionnaires and cognitive tests will help to support the research. Experimental and control groups were used to gather relevant records. To analyse and support the interpretation of the data gathered by questionnaires, the chi-square test (two-tailed) has been used. ANOVA has been used to evaluate data for the achievement test results. The preliminary research revealed there is a possibility of using developed programming discourse DCBLP in digital logic training. Students claim overall usefulness of the discourse in the training; the strong motivation power of the programming discourse itself has not been discovered. From the test we conclude that the performance of the students trained using new programming discourse is significantly better. It is possible to use more different programming paradigms, such as imperative and declarative, in one solution to support training in the area of digital logic. Such solutions can enhance the way the students deal with the programming languages and also supports interdisciplinary relationships.


2013 ◽  
Vol 465-466 ◽  
pp. 387-394
Author(s):  
Muhammad Ashraf Fauri Fauzi ◽  
Daeng Ahmad Zuhri Zuhud ◽  
Hafiz Husin

Digital computers that automate manufacturing process are an important aspect for any manufacturing engineers in the modern world. Selection of the programming paradigm (PP), as well as the programming language (PL) that supports it, is crucial to ensure the correct ideas are being used to automate the solution of the problem. In current Malaysian Higher institution practices, various PPs and PLs courses are offered to current undergraduate manufacturing majors. An online survey was deployed to experienced manufacturing engineers from various manufacturing specializations in the industry. Graduates from one of Malaysias public universities, International Islamic University Malaysia (IIUM) have been chosen for this particular study. From the survey, it has been found that almost 80% of the participants agreed that PPs are important for manufacturing graduates. It was found out that 90% of the participants were from intermediate (scale of 3) until poor (scale of 1) to express their ability to explain PPs if asked. Only about 10% are able to explain on PPs (scale of 4 and 5). The study concluded that majority of the manufacturing graduates from IIUM agreed that PP is an important subject to be taught in university. However, it was found the majority of the manufacturing graduates lack the knowledge and understanding of PPs and general PLs.


Author(s):  
Ekawit Nantajeewarawat ◽  
◽  
Kiyoshi Akama ◽  
Hidekatsu Koike ◽  
◽  
...  

Unfolding transformation has long been used for computation and program transformation both in functional programming and logic programming paradigms. In this paper, we clarify that an unfolding step can be regarded as the composition of two simpler operations, i.e., expanding transformation and unification, and show that expanding transformation, rather than unfolding transformation, is a suitable basis for verifying the correctness of rewriting rules by pattern manipulation, which in turn provides a basis for systematically generating rewriting rules from a given problem description. We verify the correctness of expanding transformation and demonstrate the correctness of a basic class of rewriting rules, called general rewriting rules, based on expanding transformation. Applying expanding transformation and its correctness result, we demonstrate correctness verification of a larger class of rewriting rules, called expanding-based rewriting rules, by transformation of clause patterns.


Sign in / Sign up

Export Citation Format

Share Document