On the Expressivity of Typed Concurrent Calculi

2024/08/15 by Paulus, Joseph William Neal
#FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Programming Languages (cs.PL)

paper · doi:10.48550/arxiv.2408.07915

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.

Related

• Expressiveness via Intensionality and Concurrency
• \unicode8523 means Parallel: Multiplicative Linear Logic Proofs as Concurrent Functional Programs
• LAGC Semantics of Concurrent Programming Languages
• Computation and Concurrency
• Functions as proofs as processes