On the Expressivity of Typed Concurrent Calculi
Logic in Computer Science
2024-08-16 v1 Programming Languages
Abstract
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.
Cite
@article{arxiv.2408.07915,
title = {On the Expressivity of Typed Concurrent Calculi},
author = {Joseph William Neal Paulus},
journal= {arXiv preprint arXiv:2408.07915},
year = {2024}
}
Comments
Doctoral thesis