{"title":"SETL的自动和半自动优化","authors":"J. Schwartz","doi":"10.1145/800233.807044","DOIUrl":null,"url":null,"abstract":"The compilation of SETL, a programming language of high level based upon the dictions and semantic concepts of the mathematical theory of sets, raises optimization problems connected with the copying, representation, type-checking and indexing of composite data objects and subobjects. Methods are prescribed for treating some of these problems by adapting known techniques of global program analysis and optimization. A programmer-assisted approach to related, less tractable optimization problems is suggested.","PeriodicalId":265634,"journal":{"name":"SIGPLAN Symposium on Very High Level Languages","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1974-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Automatic and semiautomatic optimization of SETL\",\"authors\":\"J. Schwartz\",\"doi\":\"10.1145/800233.807044\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The compilation of SETL, a programming language of high level based upon the dictions and semantic concepts of the mathematical theory of sets, raises optimization problems connected with the copying, representation, type-checking and indexing of composite data objects and subobjects. Methods are prescribed for treating some of these problems by adapting known techniques of global program analysis and optimization. A programmer-assisted approach to related, less tractable optimization problems is suggested.\",\"PeriodicalId\":265634,\"journal\":{\"name\":\"SIGPLAN Symposium on Very High Level Languages\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1974-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIGPLAN Symposium on Very High Level Languages\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800233.807044\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGPLAN Symposium on Very High Level Languages","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800233.807044","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The compilation of SETL, a programming language of high level based upon the dictions and semantic concepts of the mathematical theory of sets, raises optimization problems connected with the copying, representation, type-checking and indexing of composite data objects and subobjects. Methods are prescribed for treating some of these problems by adapting known techniques of global program analysis and optimization. A programmer-assisted approach to related, less tractable optimization problems is suggested.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
