On the Expressivity of Typed Concurrent Calculi
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929460149747712 |
|---|---|
| author | Paulus, Joseph William Neal |
| author_facet | Paulus, Joseph William Neal |
| contents | This thesis embarks on a comprehensive exploration of formal computational models that underlie typed programming languages. We focus on programming calculi, both functional (sequential) and concurrent, as they provide a compelling rigorous framework for evaluating program semantics and for developing analyses and program verification techniques. This is the full version of the thesis containing appendices. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_07915 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the Expressivity of Typed Concurrent Calculi Paulus, Joseph William Neal Logic in Computer Science Programming Languages This thesis embarks on a comprehensive exploration of formal computational models that underlie typed programming languages. We focus on programming calculi, both functional (sequential) and concurrent, as they provide a compelling rigorous framework for evaluating program semantics and for developing analyses and program verification techniques. This is the full version of the thesis containing appendices. |
| title | On the Expressivity of Typed Concurrent Calculi |
| topic | Logic in Computer Science Programming Languages |
| url | https://arxiv.org/abs/2408.07915 |