## User login## Navigation |
## archives## Introduction to processes (Tony Hoare's CSP processes)During the design of the programming language which allows formal verification I had to design concurrency features as well. In order to define concurrency properly in the setup of formal verification some form of process algebra is needed. The process algebra and statemenst about properities of processes had to be integrated into the programming language. The following paper describes how I intend to integrate concurrency into the programming language. I used Tony Hoare's CSP model (communicating sequential processes) as the basic theory. Since the design of the programming language is still an ongoing activity any comments are welcome. |
## Browse archives## Active forum topics- Looking for references on the expressiveness and computational completeness of a relational programming language
- language handling of memory and other resource failures
- Whither FRP?
- Programming Languages as Mathematical Representations
- Is there a language with the ability to write arbitrary type functions?
## New forum topics |

## Recent comments

3 hours 20 min ago

10 hours 34 min ago

12 hours 52 min ago

14 hours 9 min ago

14 hours 55 min ago

16 hours 13 min ago

16 hours 19 min ago

19 hours 7 min ago

19 hours 59 min ago

20 hours 11 min ago