{"title":"On the Expressivity of Typed Concurrent Calculi","authors":"Joseph William Neal Paulus","doi":"arxiv-2408.07915","DOIUrl":null,"url":null,"abstract":"This thesis embarks on a comprehensive exploration of formal computational\nmodels that underlie typed programming languages. We focus on programming\ncalculi, both functional (sequential) and concurrent, as they provide a\ncompelling rigorous framework for evaluating program semantics and for\ndeveloping analyses and program verification techniques. This is the full\nversion of the thesis containing appendices.","PeriodicalId":501197,"journal":{"name":"arXiv - CS - Programming Languages","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Programming Languages","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.07915","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
