Programming Paradigms

The motivation and the basic issues for designing the programming system - ELa, that allowed combination of different programming paradigms is presented in the part one of this paper. In the ELa system distinct styles of programming (functional, logic and object-oriented) are enabled. The system is currently under development at the Institute of Mathematics in Novi Sad. In this paper we describe the problem definition of a multiprogramming system, and the current state of realization of that programming system. In the part two we will illustrate the ELa system that permit the combination of the functional, the logical and the object oriented paradigm of programming.

Jerinić, Lj., A Perspective on Combining Different Programming Paradigms. Bulletins for Applied Mathematics, BAM 1066/95 (LXXV), (May 1995) Budapest, 35-46.

Implementing multi-touch and multi-modal systems requires splitting the code across several event handlers, which complicates programmers work.
The present paper finds the root of this problem in the event-driven paradigm; more concretely, in the fact that event-driven languages lack abstractions for representing event sequences. It then suggests to augment event-driven languages so that programmers can have the possibility to define event sequences --herein called composite events-- that can then be bound to event handlers. The main features of the composite event-driven language developed by the authors are outlined, as well as its benefits and problems.
The paper suggests that, since its design, the event-driven paradigm was tailored for mouse-based interactions, and it may be important to question its suitability for implementing multi-touch and multi-modal interactions.

Lanjutan Arsip Pengantar Pemrograman, Kuliah ini mengajarkan tetang konsep dasar pemrograman. Pada kuliah ini akan dijelaskan dasar-dasar pemrograman meliputi algoritma, flow chart dan pseudo code.  Selanjutnya masuk ke implementasi dengan pemrograman, dijelaskan materi-materi dasar pembuatan program meliputi : dasar-dasar pemrograman, penyeleksian kondisi, perulangan, fungsi, array, string, pointer dan struktur.  Bahasa pemrograman yang digunakan adalah bahasa C/C++

Cada problema requer um ponto de vista para ser olhado. As linguagens de programação são construídas para dar “amplitude” neste olhar, e assim, resolver problemas que antes não puderam ser resolvidos, ou eram resolvidos precária e paliativamente. Com o passar dos anos, vários paradigmas de programação foram sendo desenvolvidos, todos eles pela necessidade de resolver problemas que outros paradigmas (olhares) não resolviam.

The motivation and the basic issues for designing the programming system -ELa, that allowed combination of different programming paradigms is presented in the part one of this paper. In the ELa system distinct styles of programming (functional, logic and object-oriented) are enabled. The system is currently under development at the Institute of Mathematics in Novi Sad. In this paper we describe the problem definition of a multiprogramming system, and the current state of realization of that programming system. In the part two we will illustrate the ELa system that permit the combination of the functional, the logical and the object-oriented paradigm of programming.

Programming differs from Poetry in that, the former follows a particular order and sequence with the
aim of executing a given instruction, though both require lots of thinking. This sequential process of
programming, called, algorithm, is usually taught at the early stage of computer degree programme at
any higher institution of learning, mostly as Introduction to Computer (CSC101) or Introduction to
Programming (CSC102). While different programming paradigms featured different language
designs, all still adopt algorithmic steps of programming. While students learn the different syntax of
these paradigms, it is assumed coping with and conquering the language/paradigm is just a matter of
learning the design and syntax, as it is still the same algorithmic knowledge that will be applied. This
comparative study looks into performances of students in different programming paradigms. The
result of the analysis carried out using Statistical Package for Social Science (SPSS) and accessing the
programming courses’ results of CSC Dept., AAUA for some specified academic sessions shows
that, there is a ‘slim’ difference in the performances of students in the various programming
paradigms. Worthy of note however is the chart analysis that further shows that UTME students
performed better in all the programming courses than the D.E. students, largely due to the fact that,
they were taught the rudiments of programming at their 100Level.

Spatial computing is an emerging field that recognizes the importance of explicitly handling spatial relationships at three levels: computer architectures, programming languages and applications. In this context, we present MGS, an experimental programming language where data structures are fields on abstract spaces. In MGS, fields are transformed using rules. We show that this approach is able to unify, at least for programming purposes, several computational models like Lindenmayer systems and cellular automata. The MGS notions of topological collection and transformation are formalized using concepts developed in algebraic topology. We propose to use transformations in order to implement a discrete version of some differential operators. These transformations satisfy a Stokes-like theorem. This result constitutes a geometric view of programming where data are handled like fields in physics. The relevance of this approach for the design of autonomic software systems is discussed in the conclusion

Control Network Programming (CNP) is a style of high-level programming that is especially effective for solving problems that have natural graph-like representation of imperative, declarative, or mixed nature. The 'program' is often nondeterministic. The report is aimed as a concise, 'modern', and relatively self-contained introduction to the background and philosophy of CNP, its implementation fundamentals, as well as its relationship to other programming paradigms.

OBJECT-ORIENTED CONCEPTS Object orientation is based on four important concept^:^ objects, abstract data typing (encapsulation and information hiding), inheritance (of attributes and behavior), and polymorphism. Unlike SPP, OOP uses objects, not algorithms, as its ...

ABSTRACT In the late 1960s, tensions were erupting in corporate and academic computing cultures in the United States and abroad with competing views about the state of computer programming and possible future implications. A discourse of "software crisis" was ignited in 1968 when NATO hosted a conference on the topic of software engineering. The author examines the rhetoric of crisis, revolution, and promise in computer programming cultures by viewing it through the lens of two dissimilar leaders, Grace Hopper and Edsger Dijkstra, who articulated views through discourses about computer programming that reveal multiple ideals and tensions. As representatives and exemplars of different communities, they emphasized pragmatic versus theoretical stances, respectively. The historical context they operated in also highlights the cultural complexities of gender in computer programming, a durable phenomenon that continues today.

This is the second in a series of two reports presenting a comparison between the Control Network Programming language Spider and the logic programming language Prolog. Here, the focus is on juxtaposing the tools for programmer's control of the computation (inference) offered by the two languages.

Las ciencias sociales en general y las ciencias de la Educación en particular, atraviesan, en la actualidad, una crisis evidente en su proceder científico. Su alcance, que afecta en la teoría y en el método a las concepciones vigentes.en largos años de trabajo normativo y disciplinario, llega incluso a un cuestionamiento crítico de su paradigma.

Control Network Programming (CNP) is a programming paradigm which is being described with the maxim " Primitives + Control Network = Control Network program ". It is a type of graphic programming. The Control Network is a recursive system of graphs; it can be a purely descriptive specification of the problem being solved. Clearly, 'drawing' the control network does not include any programming. The Primitives are elementary, easily understandable and clearly specified actions. Ultimately, they have to be programmed. Historically, they are usually coded in Free Pascal. The actual code of the primitives has never been considered important. The essence of an " algorithm " is represented by its control network. CNP was always meant to be an easy and fast approach for software application development that actually involves very little real programming. Language interoperability (using different languages in the same software project) is a distinguished current trend in software development. It is even more important and natural in the case of CNP than for other programming paradigms. Here, interoperability practically means the possibility to use primitives written in various programming languages. The current report describes our first steps in creating applications using a multi-language set of primitives. Most popular and interesting programming languages have been addressed: Python, Java, and C. We show how to create applications with primitives written in those 'non-native' languages. We consider examples where the primitives in all those four programming languages are simultaneously used (multiple-language CNP). We also discuss CNP programming without programming (language-free CNP).

We give the easily recognizable name " cinnamon " and " cinnamon programming " to a new computation model intended to form a theoretical foundation for Control Network Programming (CNP). CNP has established itself as a programming paradigm combining declarative and imperative features, built-in search engine, powerful tools for search control that allow easy, intuitive, visual development of heuristic, nondeterministic, and randomized solutions. We define rigorously the syntax and semantics of the new model of computation, at the same time trying to keep clear the intuition behind and to include enough examples. The purposely simplified theoretical model is then compared to both while-programs (thus demonstrating its Turing completeness), and the " real " CNP. Finally, future research possibilities are mentioned that would eventually extend the cinnamon programming into the directions of non determinism, randomness and fuzziness.

This paper presents a personal perspective on some of the issues raised at a Workshop on Functional and Logic Programming Languages at the University of Stirling on April 25th, 1986. It is particularly concerned with the question: Are purely declarative principles sufficient for general purpose computing applications? The consideration of notions of "computational" and "ambient" state in a programming system suggests possible limitations of purely declarative methods where interactive applications are concerned. An alternative framework for general purpose programming systems, based upon the author's work on "definitive notations", is briefly outlined.

We give the easily recognizable name " cinnamon " and " cinnamon programming " to a new computation model intended to form a theoretical foundation for Control Network Programming (CNP). CNP has established itself as a programming paradigm combining declarative and imperative features, built-in search engine, powerful tools for search control that allow easy, intuitive, visual development of heuristic, nondeterministic, and randomized solutions. We define rigorously the syntax and semantics of the new model of computation, at the same time trying to keep clear the intuition behind and to include enough examples. The purposely simplified theoretical model is then compared to both while-programs (thus demonstrating its Turing completeness), and the " real " CNP. Finally, future research possibilities are mentioned that would eventually extend the cinnamon programming into the directions of non determinism, randomness and fuzziness.

Control Network Programming is a programming paradigm that integrates ideas from imperative programming, declarative programming, rule-based systems, nondeterministic programming and graphical programming. Its computation rule is based on an extended specific version of backtracking. The report presents a comparison of the Spider language for control network programming versus the logic programming language Prolog. .

Threads are a seemingly straightforward adaptation of the dominant sequential model of computation to concurrent systems. Languages require little or no syntactic changes to support threads, and operating systems and architectures have evolved to efficiently support them. Many technologists are pushing for increased use of multithreading in software in order to take advantage of the predicted increases in parallelism in computer architectures. In this paper, I argue that this is not a good idea. Although threads seem to be a small step from sequential computation, in fact, they represent a huge step. They discard the most essential and appealing properties of sequential computation: understandability, predictability, and determinism. Threads, as a model of computation, are wildly nondeterministic, and the job of the programmer becomes one of pruning that nondeterminism. Although many research techniques improve the model by offering more effective pruning, I argue that this is approaching the problem backwards. Rather than pruning nondeterminism, we should build from essentially deterministic, composable components. Nondeterminism should be explicitly and judiciously introduced where needed, rather than removed where not needed. The consequences of this principle are profound. I argue for the development of concurrent coordination languages based on sound, composable formalisms. I believe that such languages will yield much more reliable, and more concurrent programs.

Human-level AI will require much more than just common sense about the world. It will require compassionate intelligence to guide interaction and build applications of the future. The cognition of such an agent includes Meta- cognition: thinking about thinking, thinking about feeling, and thinking about others’ thoughts and feelings. We summarize the core meta-architectures and meta-processes of EM-2, a meta-cognitive agent that uses affective inference and an irrational TMS, the I-TMS, to resolve the turf war between thoughts and feelings based on agent personality rather than logic. The work is inspired by a human mind training process from India called Vipassana and 17th century commonsense philosopher David Hume. Although separated by more than 2000 years they both present a philosophy of mind where emotion is the antecedent to logical thought.

Control Network Programming (CNP) is a programming paradigm which is being described with the maxim "Primitives + Control Network = Control Network program". It is a type of graphic programming. The Control Network is a recursive system of graphs; it can be a purely descriptive specification of the problem being solved. Clearly, "drawing" the control network does not include any programming. The Primitives are elementary, easily understandable and clearly specified actions. Ultimately, they have to be programmed. Historically, they are usually coded in Free Pascal. The actual code of the primitives has never been considered important. The essence of an "algorithm" is represented by its control network. CNP was always meant to be an easy and fast approach for software application development that actually involves very little real programming. Language interoperability (using different languages in the same software project) is a distinguished current tr...

Parallel/Distributed application development is an extremely difficult task for non-expert programmers, and support tools are therefore needed for all phases of the development cycle of these kinds of application. This study specifically presents the development of an analytical performance model for pipelined applications. This model is intended to be used in the POETRIES distributed-program development environment, which is aimed at dynamic performance tuning based on frameworks with an associated performance model.

Object-oriented techniques have been along the last decade one of the most useful programming paradigms. However, for distributed embedded systems the semantic gap between the object-orientation layer and the underlying infrastructure is extremely large. This gap can be narrowed, should the embedded system platform provide semantically rich communication and management services. This paper outlines our research effort in the provision of such services by CAN-based (Controller Area Network) systems. 1

El presente artículo aborda el tema de los paradigmas  de  programación  explicándolos  de  una manera simple y presentándolos en una línea de tiempo conceptual que puede interpretarse como una  necesidad  en  la  evolución  del  pensamiento humano. Se hace una breve descripción, no solo de los paradigmas sino de sus aplicaciones, que a  la  postre  también  se  han  asimilado  y  entendido como paradigmas y, se presentan algunas reflexiones acerca de la incidencia que ha tenido la evolución  del  pensamiento  en  conjunto  con  las nuevas necesidades del ser humano como de su proyección en el tiempo y lo que podría sobrevenir en el mundo de la programación de computadores en un futuro no muy lejano.

Executing large number of independent tasks or tasks that perform minimal inter-task communication in parallel is a common requirement in many domains. In this paper, we present our experience in applying two new Microsoft technologies Dryad and Azure to three bioinformatics applications. We also compare with traditional MPI and Apache Hadoop MapReduce implementation in one example. The applications are an EST (Expressed Sequence Tag) sequence assembly program, PhyloD statistical package to identify HLA-associated viral evolution, and a pairwise Alu gene alignment application. We give detailed performance discussion on a 768 core Windows HPC Server cluster and an Azure cloud. All the applications start with a "doubly data parallel step" involving independent data chosen from two similar (EST, Alu) or two different databases (PhyloD). There are different structures for final stages in each application.

ROO, Rule-oriented cOOperative problem-solving tOOlkit, is a toolkit for building and experimenting with rule-based cooperative assumption-based reasoning systems. ROO has evolved from experience with three widely varying applications: distributed interpretation for global networks of seismic monitoring stations in Comprehensive Test Ban Treaty Verification, distributed planetary exploration using hybrid reactive-planning ISX-Robotics T-1 micro-rovers, and distributed scheduling for global networks of robotic telescopes. The basic components of ROO include 1) a multicontext, multi-agent assumption-based TMS, the DATMS, 2) the beliefbased agent programming language, BBRL, which provides agents with access to the history of belief states to selectively focus among incoming results and supports creation of heterogeneous CKBS by promoting a separation between socializing and domain problem solving, and 3) the Multi-Agent Test Environment, MATE, that alleviates much of the tedium of running experiments with CKBS, including automatic network resource allocation, monitoring and executing sequences of experiments without human intervention, and automatic archival of experiment results and messages.

Over the past few decades a great deal of research has been devoted to the development of real-time components and systems. Examples include real-time operating systems, real-time schedulers, real-time object models and realtime object brokers. Nevertheless, efforts to build such large scale systems have lagged behind due to interoperability problems, programming paradigms which are difficult to use, an absence of a standard QoS specification language, a general lack of maturity in software engineering processes involved, and logistic difficulties of building large-scale, distributed, real-time systems within reasonable expenditure of resources. This paper focuses on the initial phases of a recent effort (the QUITE project) to build a large-scale, QoS-aware, real-time system based on the integration of research technologies that have received funding from the Defense Advanced Research Project Agency's Quorum program. It emphasizes the process aspects of the QUITE integration effort.

Object oriented techniques have been along the last decade one of the most useful programming paradigms. However, for distributed embedded systems, the semantic gap between the object orientation layer and the underlying infrastructure is extremely large. This gap can be narrowed, should the embedded system platform provide semantically rich communication and management services. The paper outlines our research effort in the provision of such services by CAN based (Controller Area Network) systems.

In this paper we describe how to apply powerful performance analysis techniques to understand the behavior of multilevel parallel applications. We use the Paraver/OMPItrace performance analysis system for our study. This system consists of two major components: The OMPItrace dynamic instrumentation mechanism, which allows the tracing of processes and threads and the Paraver graphical user interface for inspection and analyses of the generated traces. We apply the system to conduct a detailed comparative study of a benchmark code implemented in five different programming paradigms applicable for shared memory computer architectures.

Control Network Programming (CNP) is a graphical nonprocedural programming style whose built-in inference engine (interpreter) is based on search in a recursive network. This paper is the third in a series of reports that share a common objective – comparison between the CNP language SPIDER and the logic programming language PROLOG. The focus here is on the comparative investigation of their interpreters, presented in a generic formal frame – reduction of goals. As a result of juxtaposing their pseudo-codes the advantages of SPIDER are outlined.

Control network programming (CNP) is a style of high-level programming created to be especially convenient for solving problems with natural graph-like representation. Showing that this goal has been achieved is the purpose of the current report. CNP solutions to four problems representative of four important problem classes are presented. Most of the problem descriptions are nondeterministic and declarative, without specifying an algorithmic solution. These natural problem descriptions are easily converted into working control network programs.

The use of middleware has extended from simply facilitating applications' communication to a broad set of services supporting a huge spectrum of networked and distributed computing environments. At the same time mobile wireless ad hoc networks (MANET) have become a popular distributed environment and its application domain is expanding rapidly. However, like all distributed environments several issues must be considered and many problems have to be addressed to have efficient and useful applications. Current researchers moved towards using middleware to provide solutions to these issues and simplify application development for MANETs. In this paper we cover the latest trends and developments in middleware for MANETs and survey these approaches to identify their qualities and limitations. We then classify these approaches into six categories that group them based on the communication models and the programming paradigm used. The paper also evaluates these approaches in terms of the identified categories such as support for mobility, openness and heterogeneity, and the ease of use. Finally, we try to identify the open issues and the possible research directions that would provide better middleware solutions for MANETs. also over eight years of industry experience in systems integration and middleware.

Spatial computing is an emerging field that recognizes the importance of explicitly handling spatial relationships at three levels: computer architectures, programming languages and applications. In this context, we present MGS, an experimental programming language where data structures are fields on abstract spaces. In MGS, fields are transformed using rules. We show that this approach is able to unify, at least for programming purposes, several computational models like Lindenmayer systems and cellular automata. The MGS notions of topological collection and transformation are formalized using concepts developed in algebraic topology. We propose to use transformations in order to implement a discrete version of some differential operators. These transformations satisfy a Stokes-like theorem. This result constitutes a geometric view of programming where data are handled like fields in physics. The relevance of this approach for the design of autonomic software systems is discussed in the conclusion