使用明显可同步的序列表达式而不是循环

R. Waters
{"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}
引用次数: 4

摘要

很长一段时间以来,人们都知道序列表达式(数据聚合的函数表达式)比循环更容易编写和维护。然而,在通常的实现中,序列表达式的效率远不如循环。以适度限制可以编写的内容为代价,显然可同步的序列表达式通过保证每个序列表达式都可以自动转换为高效的循环来解决这个问题。使用Lisp和Pascal原型证明了明显可同步的序列表达式可以添加到任何编程语言中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信