{"title":"Sharing Analysis in the Pawns Compiler","authors":"Lee Naish","doi":"arxiv-2409.02398","DOIUrl":null,"url":null,"abstract":"Pawns is a programming language under development that supports algebraic\ndata types, polymorphism, higher order functions and \"pure\" declarative\nprogramming. It also supports impure imperative features including destructive\nupdate of shared data structures via pointers, allowing significantly increased\nefficiency for some operations. A novelty of Pawns is that all impure \"effects\"\nmust be made obvious in the source code and they can be safely encapsulated in\npure functions in a way that is checked by the compiler. Execution of a pure\nfunction can perform destructive updates on data structures that are local to\nor eventually returned from the function without risking modification of the\ndata structures passed to the function. This paper describes the sharing\nanalysis which allows impurity to be encapsulated. Aspects of the analysis are\nsimilar to other published work, but in addition it handles explicit pointers\nand destructive update, higher order functions including closures and pre- and\npost-conditions concerning sharing for functions.","PeriodicalId":501197,"journal":{"name":"arXiv - CS - Programming Languages","volume":"47 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-04","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-2409.02398","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Pawns is a programming language under development that supports algebraic
data types, polymorphism, higher order functions and "pure" declarative
programming. It also supports impure imperative features including destructive
update of shared data structures via pointers, allowing significantly increased
efficiency for some operations. A novelty of Pawns is that all impure "effects"
must be made obvious in the source code and they can be safely encapsulated in
pure functions in a way that is checked by the compiler. Execution of a pure
function can perform destructive updates on data structures that are local to
or eventually returned from the function without risking modification of the
data structures passed to the function. This paper describes the sharing
analysis which allows impurity to be encapsulated. Aspects of the analysis are
similar to other published work, but in addition it handles explicit pointers
and destructive update, higher order functions including closures and pre- and
post-conditions concerning sharing for functions.