Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 2,327 papers for “Procedural programming”

Procedural programming

Paul R. Wellin · Cambridge University Press eBooks · 2013

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.

Cited by 0

Procedural programming in database

Nimrichter, Adam · Brno University of Technology Digital Library (Brno University of Technology) · 2015

Práce se zabývá ověřením konceptu provádět výpočty přímo v databázi. Popisuje databázi PostgreSQL, její vlastnosti a procedurální jazyk PL/pgSQL. Dále se věnuje metodám strojového učení, návrhu algoritmu pro dopředný výběr příznaků a ověřením jeho funkčnosti. Hojně využívá rozšiřující knihovny analytických funkcí MADlib, která poskytuje implementace matematických, statistických a strojních učebních metod pro strukturovaná a nestrukturovaná data.

Cited by 0

A Procedural Way of Teaching Procedural Programming Language

M. Abdullah‐Al‐Wadud · 2016

A procedural programming language such as C and Pascal is usually the first programming language the most the students come across. However, in most curriculums, the concept of procedure’is introduced to the students after almost half of the course is covered. Many students are then found to be reluctant to get the fruit of procedural style of programming. They tend to write big programs without making use of procedures, functions or subroutines. Thus they do not feel the charm of programming as it should be encountered to solve a problem. This paper proposes a guideline of designing the curriculum of procedural programming language courses where thinking in a procedural manner is emphasized so that the learners can follow the art of procedural languages more comprehensively that the traditional style of curriculum design

Cited by 1

Procedural programming and its difference from object oriented programming

Chimariya, Adesh · Theseus (Ammattikorkeakoulujen) · 2012

This thesis will try and focus on comparing Procedural programming with Object oriented programming. It shows the comparison of PP and OOP via statistics. It compared PP and OOP via application tests, speed and performance. This was done by comparing the speed of both programming languages to run a similar example. The difference between C Struct and C++ classes was also taken into consideration. 
\n
\nIn order to illustrate different aspects and use cases of PP and OOP, C and C++ programming languages will be used respectively. Several examples have been used throughout the thesis for comparing PP and OOP. As a result of given research, the importance and usability of PP and OOP was realized. It became obvious that PP is not an "old" paradigm, how majority used to believe, or not even just a predecessor of object oriented high level languages. It is separate way of thinking and programming, which goes along with machine logic and compiler practices. It is very useful paradigm when computing heavy calculations or processing data in sequential order. It was also realized that OOP has many optimization techniques, never the less, PP has it's own ways of speeding up the process of compilation and run by keeping it simple for the compiler to follow the program structure from the top to bottom.

Cited by 0

Adding multidimensionality to procedural programming languages

Panos Rondogiannis · Software Practice and Experience · 1999

One of the most serious shortcomings of multidimensional languages is their inability to collaborate with conventional programming languages and systems. Multidimensional languages are used to define (potentially infinite) streams, grids, cubes, and so on, concepts which resemble in nature the familiar imperative arrays. The main difference is that the former entities are lazy while the latter are generally eager. This paper proposes the embedding of multidimensional languages into conventional ones as a form of definitional lazy arrays. The paper describes the details of an implementation of the proposed idea, as well as the expressibility and the performance of the resulting system. The main advantage of the new approach is that multidimensional languages can now benefit from the advanced features that have been developed for conventional languages. Moreover, multidimensionality adds to conventional languages the idea of lazy arrays, which in many cases offer significant advantages compared to the classical imperative arrays. Copyright © 1999 John Wiley & Sons, Ltd.

Cited by 4

An experiment in non-procedural programming

Jesse H. Katz, W. C. McGee · 1963

Computer processes have traditionally been specified by means of procedural languages. That is, a computer program is generally expressed as a sequence of steps.

Cited by 10Open access

Adding multidimensionality to procedural programming languages

Panos Rondogiannis · Software Practice and Experience · 1999

One of the most serious shortcomings of multidimensional languages is their inability to collaborate with conventional programming languages and systems. Multidimensional languages are used to define (potentially infinite) streams, grids, cubes, and so on, concepts which resemble in nature the familiar imperative arrays. The main difference is that the former entities are lazy while the latter are generally eager. This paper proposes the embedding of multidimensional languages into conventional ones as a form of definitional lazy arrays. The paper describes the details of an implementation of the proposed idea, as well as the expressibility and the performance of the resulting system. The main advantage of the new approach is that multidimensional languages can now benefit from the advanced features that have been developed for conventional languages. Moreover, multidimensionality adds to conventional languages the idea of lazy arrays, which in many cases offer significant advantages compared to the classical imperative arrays. Copyright © 1999 John Wiley & Sons, Ltd.

Cited by 1

Procedural Programming with PostgreSQL PL/pgSQL

Baji Shaik, Dinesh Kumar Chemuduru · Apress eBooks · 2023

With this book you'll learn the basics of PL/PGSQL, the most powerful Open Source Relational Database, and see how to apply its most important features.

Cited by 2Open access

Specification of the Procedural Programming Language

Volodymyr Protsenko · NaUKMA Research Papers Computer Science · 2023

A simple procedural programming language is considered, each program of which can input integer values, process them and output new integer values as result. A program is a block with description of local integer variables and procedures and a list of statements. The language has data processing statements: assignment, input, output, conditional, loop, procedure call and block. Main purpose of the block is to enter local data (integer variables and procedures) that are used in the body of the block – a list of operators. The scope of the name of the local data described in the block is the text of the block except for nested blocks, where this name is redefined. A mechanism of automatic memory allocation for variables entered in the block is also associated with the block. Memory for local variables is allocated when entering a block, and freed when exiting a block. A block containing only a list of statements is valid. The procedure has a name, list of formal parameters, and a body – a statement (most often a block). Formal parameters are applied only in its body. A procedure is calculated by the procedure call statement, whose actual parameters are only variables. Parameters are passed by reference (pass-by-reference).A formal specification of a programming language is a description of its syntax and semantics. A concrete syntax, finite set of rules, singles out syntactically correct sequences of symbols of the alphabet of language. To describe the semantics of a language, as a rule, abstract syntax is used, adding contextual conditions to it. The task of semantics is to introduce the denotations (“meanings”) of the basic constructions of language and semantic functions that build the denotations of complex syntactic constructions based on the denotations of their components, including the program.The article provides a specification of a procedural programming language that uses the extended Backus-Naur form to describe a concrete syntax, and the tools of the functional language Haskell to describe other parts. Abstract syntax is defined by the types Program, Proc, Stmt, Expr and Op. Additional contextual conditions are predicates that use information about program data. Most of the context conditions are related to the correct use of data in the program. The leading predicate that checks the context conditions of the program pr is iswfProgram pr.The language denotations are based on the Work type. The value of this type – a tuple (inp, stg, out) models the environment in which the language program is executed: inp - input data, stg – memory containing variable values, out – resulting data. The semantics of main constructions procedure, statement and expression are functions of the type Work -> Work or Work -> Integer. The semantics of the program is a function of the type [Integer] -> [Integer]. Semantic functions build these denotations according to syntactic constructions, which are described by abstract syntax – Proc, Stmt, Expr, Program types. The semantics of the program (Program) pr is built by function iProgram pr.All functions: contextual conditions, denotations and semantic functions are pure functions. Using Haskell tools, a function called parsePLL is built, which connects concrete and abstract syntax. It is shown how by combining the functions parsePLL, iswfProgram and iProgram you can get a procedural language – a pure function with the name interpret.

Cited by 0Open access

A Comparative Study of Object-Oriented Programming Vs Procedural Programming

Rajni Shreasth · International Journal for Research in Applied Science and Engineering Technology · 2025

Abstract: This research paper offers a detailed comparative exploration of Object-Oriented Programming (OOP) and Procedural Programming (PP), two foundational paradigms that have significantly influenced the evolution of software development. It delves into their underlying principles, tracing the conceptual and structural distinctions that define each approach. The discussion highlights the historical development of both paradigms, examining how they emerged and gained prominence in different eras of computing. Rather than relying on empirical data or case studies, this study employs a theoretical and literature-based methodology to analyze core aspects such as modularity, code reusability, abstraction, and ease of maintenance. The paper outlines the strengths and limitations inherent in each paradigm, offering insights into how their respective features align with particular types of software development tasks. Object-Oriented Programming is emphasized for its encapsulation, inheritance, and polymorphism, which support scalable and maintainable code, particularly in complex systems. In contrast, Procedural Programming is examined for its simplicity, linear logic, and suitability for tasks requiring straightforward algorithmic implementation. The research also considers the implications of both paradigms in educational contexts, discussing how learners engage with each model and how they influence programming comprehension and design thinking. By synthesizing insights from programming language theory and academic literature, this study seeks to clarify the circumstances under which each paradigm is most effective. It ultimately provides readers with a structured framework for evaluating the suitability of OOP or PP depending on the goals, scale, and nature of a software project. The absence of casespecific or survey-based data ensures that the focus remains on conceptual depth and theoretical clarity, making this paper a valuable resource for learners, educators, and developers seeking a foundational understanding of programming paradigms.

Cited by 0Open access

Evolutionary software development using procedural-parametric programming

A. I. Legalov, Pavel Kosov · 2013

The article examines the methods of evolutionary software development with the use of the procedural parametric paradigm of programming. The basic program object of the paradigm are presented and their implementation in a programming language Alien is shown. The generalized records and generalizing parametric procedures are described as well as their using for the enlargement of already written a program without changing the previously written code. We consider a number of techniques that demonstrate the peculiarities of the proposed programming style. The use of generalizing procedures combined with generalized records instead of extensible types provides support for the multiple polymorphism as a special case includes a single polymorphism that is used in the objective-oriented approach. The flexibility of the proposed programming style in case of adding new data types is considered on the example of multimethods. In order to enhance the language capability it is proposed to use plug-in modules.

Cited by 0

Codification Pedagogy for Introductory Procedural Programming Courses

Rita Alicia Garcia · Adelaide Research & Scholarship (AR&S) (University of Adelaide) · 2020

Generally, students in introductory programming courses (CS1) do not devote time to designing solutions to their programming problems, even though it is a necessary part of the problem-solving process. Without the design process to reflect on a problem, students might haphazardly solve them, but with incomplete solutions. Students might skip the design process because they have limited design knowledge and lack the skills to help them identify goals and create a plan for solving a problem. Students might also ignore problem-solving information provided to them and instead rely on past problem-solving approaches, which keeps them from learning both new problem-solving strategies and new programming concepts. This research explores a pedagogical approach for procedural programming assignments facilitated within an online learning environment that encourages CS1 students to incorporate the design process into their problem-solving process. This thesis refers to the pedagogical approach as the Codification Pedagogy, a teaching approach for ordering rules corresponding to a plan. The pedagogy is designed to help students identify goals and create plans for solving problems. The pedagogy is comprised of three learning activities: 1. A scaffolded assignment presentation designed to help students better understand the programming problem. The assignment presentation helps students identify the problem’s goals and provides additional support for struggling students. This research produces a framework that educators can use to develop scaffolded presentations for CS1 programming assignments. 2. A questioning activity that encourages students to engage their internal knowledge to solve the current problem. This research produces a questioning framework. The framework contains instructional questions mapped to the Bloom’s Taxonomy cognitive levels. The framework can help educators construct learning activities through questioning to help elevate students’ cognitive level appropriate for their learning. 3. A Parsons problems activity designed to help students organise an implementation plan. Parsons problems is a learning tool that has students arrange code fragments to form a working program. The research demonstrates that Parsons problems can be used to help students organise plans to solve programming problems. The Codification Pedagogy is integrated into CS1 programming assignments. Studies were conducted for three semesters in an introductory programming course offered at the University of Adelaide. The research comprises quantitative studies using interactive analytics and variable-oriented analysis, along with qualitative studies using mixed methods that include pre-post tests, think-alouds, and interview sessions. The pedagogy is designed to help students better understand the programming problem and support their learning of problem-solving strategies for practical programming assignments. The results from this thesis demonstrates the pedagogy can support students during the design process. The studies presented in this thesis shows the pedagogy supporting students’ use of problem-solving strategies that help them to identify goals for the problems and enable them to validate their programming solutions. The results also show the learning activities encouraging students to analyse the assignment, promoting self-reflection that reduce misconceptions. Through its design-based support, the pedagogy can support students to successfully complete programming assignments.

Cited by 1Open access

Java programming paradigm comprehensibility: Procedural versus Reactive

Lundberg, Mattis, Österdahl, Pontus · Publications (Mid Sweden University) · 2021

Software developers spend more time on reading than writingcode. Comprehensible code therefore has the potential tosignificantly improve software development andmaintenance by lowering the time needed for understandingexisting code. Previous research suggest that the choice ofProgramming paradigm may affect code comprehension. Thepresent study evaluates if a positive effect of ReactiveProgramming on comprehension can be attested incomparison to Procedural Programming. We let human testsubjects solve bugs in code-snippets of commonfunctionalities implemented either according to ReactiveProgramming or Procedural Programming in the Javalanguage and RxJava, its ReactiveX implementation. Thecomprehensibility of the code is measured by the test subjects’time consumption, with lower values indicating highercomprehensibility and higher values lowercomprehensibility.Within this study we also study the effect of prior knowledgeof reactive programming, and background in programming,on the results, by having test subjects from two groups: (1)software students with experience in Reactive Programming,and (2) experienced software developers and engineers withless experience in Reactive Programming.All tests took part in a tool of our design, the CodeComparator.Our results show that reactive puzzles are solved faster,suggesting higher comprehensibility, although highdispersion in solvability time, especially for the proceduralsolutions, make it difficult to assess the validity of this timedifference. The positive effect is notable in the student groupwhereas we cannot conclude if the other group solves reactiveor procedural puzzles faster

Cited by 0Open access

Procedural Reflection in Programming Languages Volume I

Smith, Brian Cantwell · DSpace@MIT (Massachusetts Institute of Technology) · 1982

We show how a computational system can be constructed to "reason," effectively and consequentially, about its own inferential processes. The analysis proceeds in two parts. First, we consider the general question of computational semantics, rejecting traditional approaches, and arguing that the declarative and procedural aspects of computational symbols (what they stand for, and what behaviour they engender) should be analysed independently, in order that they may be coherently related.

Cited by 0Open access