Voogd, Erik (2018) Minimal Session Types. Bachelor's Thesis, Computing Science.
|
Text
main.pdf Download (371kB) | Preview |
|
![[img]](https://fse.studenttheses.ub.rug.nl/style/images/fileicons/text.png) |
Text
toestemming.pdf Restricted to Registered users only Download (94kB) |
Abstract
Session types were introduced in the theory of types to formally specify and verify that communication in distributed systems follows the intended protocols. They were originally developed within the context of a high-level abstract language called the pi-calculus, but they are finding their way to implementations in real programming languages. Processes modeled in the pi-calculus can be broken down into minimal parallel components, while preserving a well-defined operational correspondence. In this thesis, we explore a way of defining this breakdown function on processes such that it also induces minimal session types. The main result is that the function preserves typability, and we conjecture that an operational correspondence holds.
| Item Type: | Thesis (Bachelor's Thesis) |
|---|---|
| Supervisor name: | Perez Parra, J.A. and Renardel de Lavalette, G.R. |
| Degree programme: | Computing Science |
| Thesis type: | Bachelor's Thesis |
| Language: | English |
| Date Deposited: | 21 Sep 2018 |
| Last Modified: | 04 Oct 2018 08:21 |
| URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/18602 |
Actions (login required)
 |
View Item |