版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Dep. Math. and Comput. Sci. Eindhoven Univ. Technol. 5600 MB Eindhoven Netherlands
出 版 物:《INFORMATION PROCESSING LETTERS》 (信息处理快报)
年 卷 期:1990年第36卷第6期
页 面:297-299页
核心收录:
学科分类:08[工学] 0812[工学-计算机科学与技术(可授工学、理学学位)]
主 题:PROGRAM DERIVATION FORMULA MANIPULATION RECURRENCE RELATIONS FUNCTIONAL AND SEQUENTIAL PROGRAMMING
摘 要:A formal derivation is presented of an efficient algorithm for computing the sums of all segments, of a given length, of a sequence. Here, sums refers to the continued application of a binary operator of which associativity is the only known property. Recurrence relations are used to separate two concerns, viz. characterisation of the values to be computed and choosing the order in which these values will be computed.