Programming Language Design Research Articles

A COMPREHENSIVE ANALYSIS OF ARCHITECTURAL PATTERNS IN ASP.NET CORE WEB APPLICATION DEVELOPMENT

The landscape of web application development has undergone significant transformations since the inception of the World Wide Web. In the contemporary landscape of web development, a multitude of design patterns, frameworks, and programming languages are employed to construct web applications, adapting to their diverse levels of complexity. Model-View-Controller (MVC) stands out as a widely embraced design pattern in the construction of web applications. This paper's primary goal is to provide a comprehensive elucidation of the features and fundamental components intrinsic to the MVC architectural pattern. Through practical examples and in-depth analysis, readers will gain valuable insights into the nuances of MVC, empowering them to harness its capabilities for robust and effective web application development.

The Ultimate Conditional Syntax

Functional programming languages typically support expressive pattern-matching syntax allowing programmers to write concise and type-safe code, especially appropriate for manipulating algebraic data types. Many features have been proposed to enhance the expressiveness of stock pattern-matching syntax, such as pattern bindings, pattern alternatives (a.k.a. disjunction), pattern conjunction, view patterns, pattern guards, pattern synonyms, active patterns, ‘if-let’ patterns, multi-way if-expressions, etc. In this paper, we propose a new pattern-matching syntax that is both more expressive and (we argue) simpler and more readable than previous alternatives. Our syntax supports parallel and nested matches interleaved with computations and intermediate bindings. This is achieved through a form of nested multi-way if-expressions with a condition-splitting mechanism to factor common conditional prefixes as well as a binding technique we call conditional pattern flowing. We motivate this new syntax with many examples in the setting of MLscript, a new ML-family programming language. We describe a straightforward desugaring pass from our rich source syntax into a minimal core syntax that only supports flat patterns and has an intuitive small-step semantics. We then provide a translation from the core syntax into a normalized syntax without backtracking, which is more amenable to coverage checking and compilation, and formally prove that our translation is semantics-preserving. We view this work as a step towards rethinking pattern matching to make it more powerful and natural to use. Our syntax can easily be integrated, in part or in whole, into existing as well as future programming language designs.

Missed Opportunities: Oral Corrective Feedback, Heritage Learners of Spanish, and Study Abroad in Peru

Abstract This study explores how negative attitudes toward U.S. Latinx students during a study abroad program can be embodied and transmitted through instructional practices that result in missed opportunities for learning Spanish as a heritage language. Specifically, we employ ethnographic and discourse analytic methods to examine one teacher’s oral corrective feedback (OCF) practices involving two Latina students in the context of a Spanish-immersion program in Cuzco, Peru. Our analysis identifies how OCF can be imbued with deficit-based language ideologies and limit the Spanish language input that heritage learners receive during study abroad. We describe how particular OCF practices validated the school’s curricular focus on prescriptive grammar, involved the exclusionary use of grammar terms, and stigmatized heritage learners’ knowledge and abilities in Spanish. Our findings demonstrate a need for critical approaches to language pedagogy, teacher training, and program design that meet the educational needs of this growing population of study abroad students.

The eXchange Calculus (XC): A functional programming language design for distributed collective systems

Distributed collective systems are systems formed by homogeneous dynamic collections of devices acting in a shared environment to pursue a joint task or goal. Typical applications emerge in the context of wireless sensor networks, robot swarms, groups of wearable-augmented people, and computing infrastructures. Programming such systems is notoriously hard, due to requirements of scalability, concurrency, faults, and difficulty in making desired collective behaviour ultimately emerge: ad-hoc languages and mechanisms have been proposed threads like spatial computing, macro-programming, and field-based coordination.In this paper we present the eXchange Calculus (XC), formalising a tiny set of key mechanisms, usable across many different languages and platforms, allowing to express the overall interactive behaviour of distributed collective systems in a declarative way. In this approach, computation (executed in asynchronous rounds), communication (which is neighbour-based), and state over time, are all expressed by a single declarative construct, called exchange. We provide a formalisation of XC in terms of syntax, device-level and network-level semantics, prove a number of properties of the calculus, and discuss applicability considering a smart city scenario. XC is implemented as a DSL in Scala and in C＋＋, with different trade-offs in terms of productivity and platform targetting.

Stress Calculation of Key Parts of Evaporator Based on Secondary Development of ANSYS

The design process of steam generators is complex and involves a significant workload for analysis and design. To streamline this process, we have developed stress calculation software for key parts of the steam generator. The software utilizes a combination of the Qt (C++) programming language and parametric design language (APDL). By automatically generating the APDL command flow file, the software calls ANSYS for background operations and displays the results in a cloud diagram. This approach simplifies the design process and ensures accuracy in stress calculations. The tool allows users to input relevant parameters and obtain accurate calculation results, greatly reducing the complexity of ANSYS usage and enhancing design efficiency.

Design of efficient Programming Language with Lexer using ’$’-prefixed identifier

An identifier which starts with ‘$‘is known as ‘$‘-prefixed identifier and this type of identifiers are used in our research paper to improve the lexical analysis phase. This paper talks about a new programming language with ‘$‘-prefixed identifier that features a novel approach for optimizing the lexer for efficient lexical analysis which can be applied to any existing language. This approach is used to classify identifiers and keywords using ‘$‘-prefixed variables, which significantly reduces the time taken and number of iterations required during the tokenization process, leading to improved overall performance. This type of language structure allows for fast lookup and matching of tokens. We conducted a series of experiments to evaluate the performance of our lexer and compared it with a regular lexer. Our results show that our approach leads to significant improvements in time complexity and number of iterations for identifying whether the token is an identifier or a keyword, resulting in faster compilation times and improved overall performance. Our language has reduced the amount of time taken by 7-10% and 45-50% in terms of iterations. Our language and lexer represent a significant step forward in the design and implementation of high-performance programming languages by reducing the number of iterations and time taken to identify whether a token is a keyword or an identifier.

Special Delivery: Programming with Mailbox Types

The asynchronous and unidirectional communication model supported by mailboxes is a key reason for the success of actor languages like Erlang and Elixir for implementing reliable and scalable distributed systems. While many actors may send messages to some actor, only the actor may (selectively) receive from its mailbox. Although actors eliminate many of the issues stemming from shared memory concurrency, they remain vulnerable to communication errors such as protocol violations and deadlocks. Mailbox types are a novel behavioural type system for mailboxes first introduced for a process calculus by de’Liguoro and Padovani in 2018, which capture the contents of a mailbox as a commutative regular expression. Due to aliasing and nested evaluation contexts, moving from a process calculus to a programming language is challenging. This paper presents Pat, the first programming language design incorporating mailbox types, and describes an algorithmic type system. We make essential use of quasi-linear typing to tame some of the complexity introduced by aliasing. Our algorithmic type system is necessarily co-contextual, achieved through a novel use of backwards bidirectional typing, and we prove it sound and complete with respect to our declarative type system. We implement a prototype type checker, and use it to demonstrate the expressiveness of Pat on a factory automation case study and a series of examples from the Savina actor benchmark suite.

Probabilistic Programming with Stochastic Probabilities

We present a new approach to the design and implementation of probabilistic programming languages (PPLs), based on the idea of stochastically estimating the probability density ratios necessary for probabilistic inference. By relaxing the usual PPL design constraint that these densities be computed exactly, we are able to eliminate many common restrictions in current PPLs, to deliver a language that, for the first time, simultaneously supports first-class constructs for marginalization and nested inference, unrestricted stochastic control flow, continuous and discrete sampling, and programmable inference with custom proposals. At the heart of our approach is a new technique for compiling these expressive probabilistic programs into randomized algorithms for unbiasedly estimating their densities and density reciprocals. We employ these stochastic probability estimators within modified Monte Carlo inference algorithms that are guaranteed to be sound despite their reliance on inexact estimates of density ratios. We establish the correctness of our compiler using logical relations over the semantics of λ SP , a new core calculus for modeling and inference with stochastic probabilities. We also implement our approach in an open-source extension to Gen, called GenSP, and evaluate it on six challenging inference problems adapted from the modeling and inference literature. We find that: (1) ‍can automate fast density estimators for programs with very expensive exact densities; (2) convergence of inference is mostly unaffected by the noise from these estimators; and (3) our sound-by-construction estimators are competitive with hand-coded density estimators, incurring only a small constant-factor overhead.

A replication study on the intuitiveness of programming language syntax

In this article, we present a replication of an empirical experiment that evaluates intuitiveness and comprehensibility of keywords relating to different concepts in programming languages, originally conducted by Stefik and Gellenbeck. Novice programmers face many barriers when learning programming. One of these barriers is syntax, which for many languages is not designed based on empirical evidence. The purpose of the experiment was to provide more empirical evidence on the subject, to find out if the results of the original experiment can be replicated and if conducting the experiment in an environment where English is not the native language affects the results. The results of our experiment replicated most of the findings of the original study and provided further evidence that some syntactic choices in many popular programming languages are unintuitive for novice programmers. Our results suggest that the native language of participants who otherwise had good English skills had little effect when compared to the original study. These results may support programming language designers in making evidence-based design decisions and teachers of introductory programming courses in identifying some of the barriers novice programmers face.

Design choices in Max and Pure Data

Max and Pure Data are widely used patch languages for real-time media computation, especially live electronic music. Each program was developed with a particular musical production in mind: Philippe Manoury's Pluton (1998) for Max, and Sorensen/Steiger/Puckette's Lemma 1 in 1997 for Pure Data. At the same time, care was taken to make the features of both programs as aesthetically neutral as possible, in order to be useful in as wide a variety of applications as possible. One design principle has been to avoid encoding musical structures such as time or key signatures in either program. Noticeably absent is any built-in facility for machine learning or artificial intelligence. On the other hand, heuristics from programming language design such as modularity, encapsulation, and abstraction have been fundamentally influential in the designs of both Max and Pure Data.

Sistem Informasi Penjualan (E-Commerce) Pakaian Jadi Pada Nuansa Fashion Dengan Menggunakan Bahasa Pemrograman PHP dan Database Mysql

Research has been carried out on the Nuansa Fashion with the aim of developing an information system that has seemed uninformative. And from the research that was conducted, it was found some shortcomings of the old system which still uses many manual methods. From the shortcomings found, a system development can be recommended. Where in this case by using the PHP Database and MySQL Application as a system design programming language that has been commonly known among programmers. In addition, the development of this system is also supported by several references relating to several references relating to the topics discussed. The purpose of this development is later to be able to improve performance in processing data and improve the quality of information produced which can be used as a leader as a guide in making a decision for the progress of the organization he leads.

Taking Back Control in an Intermediate Representation for GPU Computing

We describe our experiences successfully applying lightweight formal methods to substantially improve and reformulate an important part of Standard Portable Intermediate Representation SPIRV, an industry-standard language for GPU computing. The formal model that we present has allowed us to (1) identify several ambiguities and needless complexities in the way that structured control flow was defined in the SPIRV specification; (2) interact with the authors of the SPIRV specification to rectify these problems; (3) validate the developer tools and conformance test suites that support the SPIRV language by cross-checking them against our formal model, improving the tools, test suites, and our models in the process; and (4) develop a novel method for fuzzing SPIRV compilers to detect miscompilation bugs that leverages our formal model. The latest release of the SPIRV specification incorporates the revised set of control-flow definitions that have arisen from our work. Furthermore, our novel compiler-fuzzing technique has led to the discovery of twenty distinct, previously unknown bugs in SPIRV compilers from Google, the Khronos Group, Intel, and Mozilla. Our work showcases the practical impact that formal modelling and analysis techniques can have on the design and implementation of industry-standard programming languages.

A HYBRID NUMERICAL TECHNIQUE FOR SOLVING THREE-DIMENSIONAL SECOND-ORDER PARABOLIC PARTIAL DIFFERENTIAL EQUATIONS

In this paper, a hybrid approach is presented for the numerical solution of three-dimensional parabolic partial differential equations. This new approach is applicable to both linear and nonlinear parabolic problems including systems. This hybrid numerical technique is based on the Haar wavelet collocation technique and the finite difference method. In this technique, the space derivative is approximated by truncated Haar wavelet series whereas the time derivative is approximated by finite difference method. The aforementioned proposed algorithms are very simple and can easily be implemented in any computer-oriented language efficiently. In order to demonstrate the efficiency and better accuracy of the newly developed numerical technique it is applied to some well-known examples from previous literature that comprises linear and nonlinear three-dimensional parabolic equations including systems. The obtained results affirm better accuracy and widespread applicability of the newly proposed numerical technique for a range of benchmark problems.

Novice Use of the Java Programming Language

Objectives. Java is a popular programming language for use in computing education, but it is difficult to get a wide picture of the issues that it presents for novices; most studies look only at the types or frequency of errors. In this observational study, we aim to learn how novices use different features of the Java language. Participants. Users of the BlueJ development environment have been invited to opt in to anonymously record their activity data for the past 8 years. This dataset is called Blackbox, which was used as the basis for this study. BlueJ users are mostly novice programmers, predominantly male, with a median age of 16 years. Our data subset featured approximately 225,000 participants from around the world. Study Methods. We performed a secondary data analysis that used data from the Blackbox dataset. We examined over 320,000 Java projects collected over the course of 8 years and used source code analysis to investigate the prevalence of various specifically selected Java programming usage patterns. As this was an observational study without specific hypotheses, we did not use significance tests. Instead, we present the results themselves with commentary, having applied seasonal trend decomposition to the data. Findings. We found many long-term trends in the data over the course of the 8 years, most of which were monotonic. There was a notable reduction in the use of the main method (common in Java but unnecessary in BlueJ) and a general reduction in the complexity of the projects. We find that there is only a small number of frequently used types: int, String, double, and Boolean, but also a wide range of other infrequently used types. Conclusions. We find that programming usage patterns gradually change over a long period of time (a period in which the Java language was not seeing major changes) once seasonal patterns are accounted for. Any changes are likely driven by instructors and the changing demographics of programming novices. The novices use a relatively restricted subset of Java, which implies that designers of languages specifically targeted at novices can satisfy their needs with a smaller set of language constructs and features. We provide detailed recommendations for the designers of educational programming languages and supporting development tools.

Introduction and elimination, left and right

Functional programming language design has been shaped by the framework of natural deduction, in which language constructs are divided into introduction and elimination rules for producers of values. In sequent calculus-based languages, left introduction rules replace (right) elimination rules and provide a dedicated sublanguage for consumers of values. In this paper, we present and analyze a wider design space of programming languages which encompasses four kinds of rules: Introduction and elimination, both left and right. We analyze the influence of rule choice on program structure and argue that having all kinds of rules enriches a programmer’s modularity arsenal. In particular, we identify four ways of adhering to the principle that ”the structure of the program follows the structure of the data“ and show that they correspond to the four possible choices of rules. We also propose the principle of bi-expressibility to guide and validate the design of rules for a connective. Finally, we deepen the well-known dualities between different connectives by means of the proof/refutation duality.

ИССЛЕДОВАНИЕ И РАЗРАБОТКА КВАНТОВОГО КОДА ДЛЯ ИСПРАВЛЕНИЯ ОШИБОК

Quantum error correction (QEC) is required in quantum computers to mitigate the impact of errorson physical qubits. The goal is to optimize the neural network for high decoding performance whilemaintaining a minimalistic hardware implementation. The errors associated with decoherence can bereduced by adopting QEC schemes that encode multiple imperfect physical qubits into a logical quantumstate, similar to classical error correction. The relevance of these studies lies in the mathematicaland software modeling and implementation of corrective codes to correct several types of quantumerrors in the development and implementation of quantum algorithms for solving classes of problems ofa classical nature. The scientific novelty of this direction is expressed in the elimination of one of theshortcomings of the quantum computing process. The development of the theory and principles for constructingmodeling systems that are resistant to external interference (dependence of data distortion onnoise, dependence of the error of a quantum computing process on the measure and purity of entanglement)for modeling quantum computing is a dynamic area, as evidenced by a large number of existingmodels reflecting certain quantum computational processes and phenomena (quantum teleportation,parallelism, entanglement of quantum states) and scientific papers. Although quantum computing is notyet ready to move from theory to practice, it is nevertheless possible to reasonably guess what form aquantum computer might take, or, more importantly for programming language design, what interface itwould be possible to interact with such a quantum computer. It is natural to apply the lessons learnedfrom the programming of classical computing to quantum computing. The analysis of works in this areashowed that a new qualitative level has now been reached, which opens up promising opportunities forthe implementation of multi-qubit quantum computing. Prospects for implementation and developmentare associated not only with technological capabilities, but also with the solution of issues of buildingeffective quantum systems for solving actual mathematical problems, cryptography problems and control(optimization) problems.

Towards the Design and Implementation of a Programming Language (Beex)

Software Engineers, Computer Scientists, and Software Experts alike are faced to decide which programming language is best suited for a certain purpose as the use of programming languages grows. When we consider the various types of programming languages available today, such as Domain Specific Languages (DSL), General Purpose Languages (GPL), Functional Programming Languages (FPL), Imperative Programming Languages (IPL), amongst others, this becomes complicated. In this study, we introduce BeeX, an interpreted language, with the aim of showing the process and principles involved in language design and consider various choices faced by language designers of various programming languages. BeeX was created with simplicity in mind, thus the study focused on architectural design options. We look at the implementation standpoint and try to figure out what the basic building parts of most programming languages are, such as lexical analysis, syntax analysis, and evaluation phase. To achieve this, we created an interactive command interface that evaluated various BeeX language constructs(conditional logic statements, arithmetic expressions, loop constructs etc.) which allowed students to easily experiment with the proposed language. The results of the tests showed that students and programmers alike can use the BeeX programming language to create a variety of code structures that are simple to use.

TYPICAL FEATURES OF THE ARCHITECTURE OF ONE-PAGE CROSSPLATFORM WEB APPLICATIONS

The work is devoted to the study of the development of one-page web applications, architectural elements, popular design templates, tools, programming languages and frameworks. During the work, the existing one-page web applications were reviewed, and one of the Reakt libraries, which is currently very effective and popular, was studied in detail. To control the state of the data and the state of the interface in javascript applications, the Redux tool is used, it is suitable for single-page applications. The disadvantages and advantages of the concept of one-page web applications in comparison with the traditional website and the native application are analyzed. Developed recommendations for creating applications.

PERANCANGAN USER INTERFACE SISTEM INFORMASI E-REPOSITORY KARYA ILMIAH PADA AKADEMI KEPERAWATAN BAITURRAHMAH PADANG BERBASIS WEB

This study aims to produce a user interface for scientific work repository information systems that are useful for facilitating the Baiturahmah Nursing Academy in searching for scientific work references online. Scientific works are scientific essays that present general facts and are written according to the correct writing methodology and the truth can be proven, the opinions in scientific works are always accompanied by supporting evidence, for that the process of storing scientific works can be arranged in a structured manner. The management of scientific works from the Baiturrahmah Nursing Academy community is currently still manual, the process to access scientific works is done by borrowing directly from the library. The method used in this research is the Waterfall Model System Development Life Cycle (SDLC) and system design tools using the UML model. While the programming language and database design used the PHP programming language and MySQL database. The results of this study are a scientific work repository application that can be accessed online which provides convenience in the process of storing scientific papers, making it easier for the Baiturrahmah Nursing Academy to find references for writing scientific papers.

The Use of Modern Technology in Journalistic Production

Press release is a technical and journalistic process that has an aesthetic and functional character. It is an important step in publishing the newspaper, which is concerned with presenting the editorial material on the page in an attractive and eye-catching manner. The sharp competition between newspapers of different directions has led to the search for ways to confirm their survival and continuity and to highlight their personality. Printing and adapting it in line with the content and general policy of the newspaper.Among the most prominent developments that the press has witnessed in terms of digital computer technology and network communication technology (the Internet), is the emergence of electronic press websites, which prompted designers and directors to find new methods and techniques, to design and produce pages, taking advantage of what the Internet provides of patterns, journalistic technical templates and new technologies in the field of Press directing, as the Internet has contributed to the development of press production through the emergence of new directing methods, and a set of design programs and programming languages ??for websites.