Structured Parallel Programming Language Based on True Concurrency

10/31/2018
by   Yong Wang, et al.
0

Based on our previous work on algebraic laws for true concurrency, we design a skeleton of structured parallel programming language for true concurrency called SPPLTC. Different to most programming languages, SPPLTC has an explicit parallel operator as an essential operator. SPPLTC can structure a truly concurrent graph to a normal form. This means that it is possible to implement a compiler for SPPLTC.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/07/2018

On the extreme power of nonstandard programming languages

Suenaga and Hasuo introduced a nonstandard programming language While^ ...
research
04/24/2020

Retrofitting Parallelism onto OCaml

OCaml is an industrial-strength, multi-paradigm programming language, wi...
research
11/15/2020

User-Centered Programming Language Design: A Course-Based Case Study

Recently, user-centered methods have been proposed to improve the design...
research
12/14/2018

Truly Visual Polymorphic Algebraic Data Structures through Maramafication

This paper presents a so-called maramafication of an essential part of f...
research
11/03/2022

Revisiting Language Support for Generic Programming: When Genericity Is a Core Design Goal

Context: Generic programming, as defined by Stepanov, is a methodology f...
research
02/04/2021

Parallel Independence in Attributed Graph Rewriting

In order to define graph transformations by the simultaneous application...
research
12/22/2020

Introducing CPL

CPL here stands for a computer programming language conceived and develo...

Please sign up or login with your details

Forgot password? Click here to reset