Structured Parallel Programming
Abstract
Based on our previous work on algebraic laws for true concurrency, we design a structured parallel programming language for true concurrency called PPL. Different to most programming languages, PPL has an explicit parallel operator as an essential operator, including its operational, denotational and axiomatic semantics. PPL can structure a truly concurrent graph to a normal form which means that it is possible to implement a compiler for PPL.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.