Towards a Modular Program Derivation via Fusion and Tupling
Towards a Modular Program Derivation via Fusion and Tupling
复制标题
通过融合和元组推导模块化程序
DOI：
10.1007/3-540-45821-2_9
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
Zhenjiang Hu
中科院分区：
文献类型：
--
作者：
W. Chin;Zhenjiang Hu
我们展示了如何通过融合来系统地得出编程珍珠，然后进行术转换。通过关注消除中间数据结构（融合），然后消除冗余呼叫（tupling），我们从天真的规范中系统地实现了空间和时间效率的算法。我们使用众所周知的最大段总和（MSS）问题说明了我们的方法，Anda鲜为人知的最大段产品（MSP）问题。尽管这两个问题具有相似的规格，但它们的Optimisedco des却大不相同。转换代码中的这种差异不会构成任何困难。通过依靠模块化技术，我们能够系统地重复我们的代码和转换。
We show how programming pearls can be systematically derived via fusion, followed by tupling transformations. By focusing on the elimination of intermediate data structures (fusion) followed by the elimination of redundant calls (tupling), we systematically realise both space andtime efficient algorithms from naive specifications. We illustrate our approach using a well-known maximum segment sum (MSS) problem, anda less-known maximum segment product (MSP) problem. While the two problems share similar specifications, their optimisedco des are significantly different. This divergence in the transformed codes do not pose any difficulty. By relying on modular techniques, we are able to systematically reuse both code and transformation in our derivation.