The Development of Procedural Programming Languages Personal Contributions and Perspectives

2000 ◽  
pp. 1-10
Author(s):  
Niklaus Wirth
Keyword(s):  
Programming Languages ◽  
Procedural Programming

scholarly journals Development of Procedural-Parametric Paradigm in the Language GO

2020 ◽  
pp. 1-11
Author(s):  
Sergey Yu. Smogluk ◽  
Eugeniy N. Garin ◽  
Daria S. Romanova
Keyword(s):  
Programming Languages ◽  
Object Oriented ◽  
Parametric Programming ◽  
Object Oriented Programming ◽  
Data Types ◽  
Programming Paradigm ◽  
Functional Capabilities ◽  
Procedural Approach ◽  
Procedural Programming ◽  
Programming Paradigms

The article presents a programming paradigm that defines a new style of program development called procedural-parametric programming (PPP). The paradigm is based on parametric polymorphism, which allows the procedures to accept and process variant data types without the algorithmic choice of alternatives within these procedures. In procedural programming languages, such types are described by unions (union in C, C++) or variant entries (in Pascal). Algorithmic processing of variants is carried out by means of conditional operators or switches. This approach is a development of procedural programming methods and acts as an alternative to object-oriented programming. The procedural-parametric paradigm of programming is an extension of the procedural approach. It makes possible to increase the capabilities of the latter by supporting data polymorphism. The application of the proposed approach will allow to increase the functional capabilities of the procedures without making any internal algorithmic changes. Procedural-parametric programming can be used both independently and in combination with other programming paradigms

RULE BASED EXPERT SYSTEM SHELLS—NEW SOFTWARE TOOLS FOR PATTERN RECOGNITION?

1989 ◽  
Vol 03 (01) ◽  
pp. 85-102
Author(s):  
H. BUNKE ◽  
J. DVORAK
Keyword(s):  
Pattern Recognition ◽  
Expert System ◽  
Programming Languages ◽  
Graph Matching ◽  
Finite State Automata ◽  
Rule Based ◽  
Finite State ◽  
Matching Graph ◽  
Procedural Programming ◽  
Context Free

In this paper, we discuss how rule based expert system shells can be used in pattern recognition for the implementation of algorithms which are procedurally oriented in their nature rather than rule based, and have traditionally been implemented in procedural programming languages. Particular examples include finite state automata, context free parsing, string matching, graph matching and discrete relaxation.

scholarly journals Generalized inversion by interpolation

Filomat ◽  
2007 ◽  
Vol 21 (1) ◽  
pp. 67-86 ◽  
Author(s):  
Predrag Stanimirovic ◽  
Milan Tasic ◽  
Predrag Krtolica ◽  
Nikolas Karampetakis
Keyword(s):  
Programming Languages ◽  
Symbolic Computation ◽  
Polynomial Matrix ◽  
Drazin Inverse ◽  
Generalized Inversion ◽  
Procedural Programming ◽  
Programming Package

We investigate two algorithms for computing the Moore-Penrose and Drazin inverse of a given one-variable polynomial matrix by interpolation. These algorithms differ in the method used for constant matrices inverses computing. The first algorithm uses the Grevile?s method, and the second one uses the Leverrier-Faddeev method and its generalization. These algorithms are especially useful for symbolic computation in procedural programming languages. We compare results by implementing the algorithms in the programming package MATHEMATICA and in the procedural programming languages DELPHI and C++.

Sign in / Sign up

Export Citation Format

Share Document