{"title":"使用明显可同步的序列表达式而不是循环","authors":"R. Waters","doi":"10.1109/ICCL.1988.13082","DOIUrl":null,"url":null,"abstract":"It has been known for a long time that series expressions (functional expressions on data aggregates) are easier to write and maintain than loops. However, as typically implemented, series expressions are much less efficient than loops. At the cost of placing modest limits on what can be written, obviously synchronizable series expressions solve this problem by guaranteeing that every series expression can be automatically converted into a highly efficient loop. It is demonstrated using Lisp and Pascal prototypes that obviously synchronizable series expressions can be added to any programming language.<<ETX>>","PeriodicalId":219766,"journal":{"name":"Proceedings. 1988 International Conference on Computer Languages","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Using obviously synchronizable series expressions instead of loops\",\"authors\":\"R. Waters\",\"doi\":\"10.1109/ICCL.1988.13082\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It has been known for a long time that series expressions (functional expressions on data aggregates) are easier to write and maintain than loops. However, as typically implemented, series expressions are much less efficient than loops. At the cost of placing modest limits on what can be written, obviously synchronizable series expressions solve this problem by guaranteeing that every series expression can be automatically converted into a highly efficient loop. It is demonstrated using Lisp and Pascal prototypes that obviously synchronizable series expressions can be added to any programming language.<<ETX>>\",\"PeriodicalId\":219766,\"journal\":{\"name\":\"Proceedings. 1988 International Conference on Computer Languages\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-10-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 1988 International Conference on Computer Languages\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCL.1988.13082\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 1988 International Conference on Computer Languages","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCL.1988.13082","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Using obviously synchronizable series expressions instead of loops
It has been known for a long time that series expressions (functional expressions on data aggregates) are easier to write and maintain than loops. However, as typically implemented, series expressions are much less efficient than loops. At the cost of placing modest limits on what can be written, obviously synchronizable series expressions solve this problem by guaranteeing that every series expression can be automatically converted into a highly efficient loop. It is demonstrated using Lisp and Pascal prototypes that obviously synchronizable series expressions can be added to any programming language.<>