scholarly journals Bounded Abstract Effects

2022 ◽  
Vol 44 (1) ◽  
pp. 1-48
Author(s):  
Darya Melicher ◽  
Anlun Xu ◽  
Valerie Zhao ◽  
Alex Potanin ◽  
Jonathan Aldrich
Keyword(s):  
Programming Languages ◽  
Programming Language ◽  
Expressive Power ◽  
Lower And Upper Bounds ◽  
Related Case ◽  
Programming Language Design ◽  
Design Perspective ◽  
Active Research ◽  
The Right

Effect systems have been a subject of active research for nearly four decades, with the most notable practical example being checked exceptions in programming languages such as Java. While many exception systems support abstraction, aggregation, and hierarchy (e.g., via class declaration and subclassing mechanisms), it is rare to see such expressive power in more generic effect systems. We designed an effect system around the idea of protecting system resources and incorporated our effect system into the Wyvern programming language. Similar to type members, a Wyvern object can have effect members that can abstract lower-level effects, allow for aggregation, and have both lower and upper bounds, providing for a granular effect hierarchy. We argue that Wyvern’s effects capture the right balance of expressiveness and power from the programming language design perspective. We present a full formalization of our effect-system design, showing that it allows reasoning about authority and attenuation. Our approach is evaluated through a security-related case study.

Method for Planning Multitasking Robot Application Programs in RAPID

2010 ◽  
Vol 166-167 ◽  
pp. 69-76
Author(s):  
Stelian Brad ◽  
Emilia Brad ◽  
Cosmin Ioanes
Keyword(s):  
Software Development ◽  
Programming Languages ◽  
Programming Language ◽  
Robot Programming ◽  
Careful Planning ◽  
Planning Tools ◽  
Robot Tasks ◽  
Set Up ◽  
Application Programs

In order to set up well-structured multitasking robot application programs careful planning is required. Robot programming languages (e.g. Karel, RAPID, Melfa, SimPro, etc.) vary from robot to robot constructor. General planning tools used in software development (e.g. UML, IDEF, etc.) require adequate professional skills and a special way of thinking such that robot programmers to apply and adapt them to the specificity of each robot programming language. Customized and intuitive planning tools of robot applications with regard to each particular programming language seem to be preferred by ordinary robot programmers and operators when facing with the development of complex robot tasks. This paper introduces such a tool in relation to the RAPIDTM programming language, specific to ABB robot models. Its effectiveness is revealed in a case study.

TURING UNIVERSALITY OF RECURSIVE PATTERNS FOR PARALLEL PROGRAMMING

2002 ◽  
Vol 12 (02) ◽  
pp. 229-246 ◽  
Author(s):  
JÖRG FISCHER ◽  
SERGEI GORLATCH
Keyword(s):  
Parallel Programming ◽  
Numerical Integration ◽  
Programming Language ◽  
Expressive Power ◽  
Recursive Functions ◽  
Partial Recursive Functions ◽  
Turing Universality ◽  
Primitive Recursive ◽  
The Way

Dijkstra's famous thesis "goto considered harmful", which paved the way for structured programming, was formally substantiated by the result of Böhm and Jacopini on the Turing universality of the three well-known basic programming constructs. We argue for a similar ideal in parallel programming — "send-receive considered harmful" — i.e. abandoning explicit send-receive statements between processors and expressing programs using a restricted set of parallel constructs. We deal with recursive patterns of parallelism, represented formally as morphisms in a suitable calculus. The aim of this paper is to study the expressive power of two morphisms – catamorphisms and anamorphisms. For a restricted program calculus based on these morphisms, we constructively prove two formal results, whose pragmatic message is: (1) A programming language based on catamorphisms is computationally equivalent to the class of primitive recursive functions; (2) A programming language based on both catamorphisms and anamorphisms is equivalent to the class of partial recursive functions and is therefore Turing-universal. We present a case study on numerical integration, demonstrating the expressive power of ana- and catamorphisms for parallel programming.

scholarly journals Cross-tier Web Programming for Curated Databases: a Case Study

2020 ◽  
Vol 15 (1) ◽  
pp. 15
Author(s):  
Simon Fowler ◽  
Simon Harding ◽  
Joanna Sharman ◽  
James Cheney
Keyword(s):  
Programming Languages ◽  
Programming Language ◽  
Web Applications ◽  
Program Transformations ◽  
Sources Of Information ◽  
Comparative Performance ◽  
Database Queries ◽  
Scientific Database ◽  
Scientific Disciplines

Curated databases have become important sources of information across several scientific disciplines, and as the result of manual work of experts, often become important reference works. Features such as provenance tracking, archiving, and data citation are widely regarded as important features for the curated databases, but implementing such features is challenging, and small database projects often lack the resources to do so. A scientific database application is not just the relational database itself, but also an ecosystem of web applications to display the data, and applications which allow data curation. Supporting advanced curation features requires changing all of these components, and there is currently no way to provide such capabilities in a reusable way. Cross-tier programming languages have been proposed to simplify the creation of web applications, where developers can write an application in a single, uniform language. Consequently, database queries and updates can be written in the same language as the rest of the program, and at least in principle, it should be possible to provide curation features reusably via program transformations. As a first step towards this goal, it is important to establish that realistic curated databases can be implemented in a cross-tier programming language. In this paper, we describe such a case study: reimplementing the web front end of a real world scientific database, the IUPHAR/BPS Guide to Pharmacology (GtoPdb), in the Links cross-tier programming language. We show how programming language features such as language-integrated query simplify the development process, and rule out common errors. Through a comparative performance evaluation, we show that the Links implementation performs fewer database queries, while the time needed to handle the queries is comparable to the Java version. Furthermore, while there is some overhead to using Links because of its comparative immaturity compared to Java, the Links version is usable as a proof-of-concept case study of cross-tier programming for curated databases. [ This paper is a conference pre-print presented at IDCC 2020 after lightweight peer review. The most up-to-date version of the paper can be found on arXiv https://arxiv.org/abs/2003.03845 ]

scholarly journals Cross-tier Web Programming for Curated Databases: a Case Study

2021 ◽  
Vol 16 (1) ◽  
pp. 21
Author(s):  
Simon Fowler ◽  
Simon Harding ◽  
Joanna Sharman ◽  
James Cheney
Keyword(s):  
Programming Languages ◽  
Programming Language ◽  
Web Application ◽  
Web Applications ◽  
Sources Of Information ◽  
Comparative Performance ◽  
Database Queries ◽  
Scientific Database ◽  
Functional Correctness

Curated databases have become important sources of information across several scientific disciplines, and as the result of manual work of experts, often become important reference works. Features such as provenance tracking, archiving, and data citation are widely regarded as important features for the curated databases, but implementing such features is challenging, and small database projects often lack the resources to do so. A scientific database application is not just the relational database itself, but also an ecosystem of web applications to display the data, and applications which allow data curation. Supporting advanced curation features requires changing all of these components, and there is currently no way to provide such capabilities in a reusable way. Cross-tier programming languages allow developers to write a web application in a single, uniform language. Consequently, database queries and updates can be written in the same language as the rest of the program, and it should be possible to provide curation features via program transformations. As a step towards this goal, it is important to establish that realistic curated databases can be implemented in a cross-tier programming language. In this article, we describe such a case study: reimplementing the web frontend of a realworld scientific database, the IUPHAR/BPS Guide to PHARMACOLOGY (GtoPdb), in the Links cross-tier programming language. We show how programming language features such as language-integrated query simplify the development process, and rule out common errors. Through an automated functional correctness evaluation, we show that the Links implementation correctly implements the functionality of the official version. Through a comparative performance evaluation, we show that the Links implementation performs fewer database queries, while the time neededto handle the queries is comparable to the official Java version. Furthermore, while there is some overhead to using Links because of its comparative immaturity compared to Java, the Links version is usable as a proof-of-concept case study of cross-tier programming for curated databases.

scholarly journals Compilation of sparse array programming models

2021 ◽  
Vol 5 (OOPSLA) ◽  
pp. 1-29
Author(s):  
Rawn Henry ◽  
Olivia Hsu ◽  
Rohan Yadav ◽  
Stephen Chou ◽  
Kunle Olukotun ◽  
...  
Keyword(s):  
Programming Languages ◽  
Programming Language ◽  
Expressive Power ◽  
Programming Models ◽  
Tensor Algebra ◽  
Sparse Arrays ◽  
Sparse Array ◽  
Algebraic Properties ◽  
Efficient Code ◽  
A Performance

This paper shows how to compile sparse array programming languages. A sparse array programming language is an array programming language that supports element-wise application, reduction, and broadcasting of arbitrary functions over dense and sparse arrays with any fill value. Such a language has great expressive power and can express sparse and dense linear and tensor algebra, functions over images, exclusion and inclusion filters, and even graph algorithms. Our compiler strategy generalizes prior work in the literature on sparse tensor algebra compilation to support any function applied to sparse arrays, instead of only addition and multiplication. To achieve this, we generalize the notion of sparse iteration spaces beyond intersections and unions. These iteration spaces are automatically derived by considering how algebraic properties annotated onto functions interact with the fill values of the arrays. We then show how to compile these iteration spaces to efficient code. When compared with two widely-used Python sparse array packages, our evaluation shows that we generate built-in sparse array library features with a performance of 1.4× to 53.7× when measured against PyData/Sparse for user-defined functions and between 0.98× and 5.53× when measured against SciPy/Sparse for sparse array slicing. Our technique outperforms PyData/Sparse by 6.58× to 70.3×, and (where applicable) performs between 0.96× and 28.9× that of a dense NumPy implementation, on end-to-end sparse array applications. We also implement graph linear algebra kernels in our system with a performance of between 0.56× and 3.50× compared to that of the hand-optimized SuiteSparse:GraphBLAS library.

scholarly journals PLIERS

2021 ◽  
Vol 28 (4) ◽  
pp. 1-53
Author(s):  
Michael Coblenz ◽  
Gauri Kambhatla ◽  
Paulette Koronkevich ◽  
Jenna L. Wise ◽  
Celeste Barnaby ◽  
...  
Keyword(s):  
Programming Languages ◽  
Programming Language ◽  
Empirical Studies ◽  
Language Design ◽  
User Performance ◽  
Safety Properties ◽  
Design Decisions ◽  
Programming Language Design ◽  
Learning Time ◽  
New Process

Programming language design requires making many usability-related design decisions. However, existing HCI methods can be impractical to apply to programming languages: languages have high iteration costs, programmers require significant learning time, and user performance has high variance. To address these problems, we adapted both formative and summative HCI methods to make them more suitable for programming language design. We integrated these methods into a new process, PLIERS, for designing programming languages in a user-centered way. We assessed PLIERS by using it to design two new programming languages. Glacier extends Java to enable programmers to express immutability properties effectively and easily. Obsidian is a language for blockchains that includes verification of critical safety properties. Empirical studies showed that the PLIERS process resulted in languages that could be used effectively by many programmers and revealed additional opportunities for language improvement.

PERANGKAT LUNAK KOMPUTER

2020 ◽  
Author(s):  
Cut Nabilah Damni
Keyword(s):  
Programming Languages ◽  
Programming Language ◽  
Operating Systems ◽  
Source Code ◽  
Computer Software ◽  
Computer Programs ◽  
Application Systems ◽  
Executable Programs

AbstrakSoftware komputer atau perangkat lunak komputer merupakan kumpulan instruksi (program atau prosedur) untuk dapat melaksanakan pekerjaan secara otomatis dengan cara mengolah atau memproses kumpulan intruksi (data) yang diberikan. (Yahfizham, 2019 : 19) Sebagian besar dari software komputer dibuat oleh (programmer) dengan menggunakan bahasa pemprograman. Orang yang membuat bahasa pemprograman menuliskan perintah dalam bahasa pemprograman seperti layaknya bahasa yang digunakan oleh orang pada umumnya dalam melakukan perbincangan. Perintah-perintah tersebut dinamakan (source code). Program komputer lainnya dinamakan (compiler) yang digunakan pada (source code) dan kemudian mengubah perintah tersebut kedalam bahasa yang dimengerti oleh komputer lalu hasilnya dinamakan program executable (EXE). Pada dasarnya, komputer selalu memiliki perangkat lunak komputer atau software yang terdiri dari sistem operasi, sistem aplikasi dan bahasa pemograman.AbstractComputer software or computer software is a collection of instructions (programs or procedures) to be able to carry out work automatically by processing or processing the collection of instructions (data) provided. (Yahfizham, 2019: 19) Most of the computer software is made by (programmers) using the programming language. People who make programming languages write commands in the programming language like the language used by people in general in conducting conversation. The commands are called (source code). Other computer programs called (compilers) are used in (source code) and then change the command into a language understood by the computer and the results are called executable programs (EXE). Basically, computers always have computer software or software consisting of operating systems, application systems and programming languages.

Sign in / Sign up

Export Citation Format

Share Document