首页> 外文会议>Programming languages and systems >Constructing List Homomorphisms from Proofs
【24h】

Constructing List Homomorphisms from Proofs

机译:从证明构造列表同态

获取原文
获取原文并翻译 | 示例

摘要

The well-known third list homomorphism theorem states that if a function h is both an instance of foldr and foldl, it is a list homomorphism. Plenty of previous works devoted to constructing list homomorphisms, however, overlook the fact that proving h is both a foldr and a foldl is often the hardest part which, once done, already provides a useful hint about what the resulting list homomorphism could be. In this paper we propose a new approach: to construct a possible candidate of the associative operator and, at the same time, to transform a proof that h is both a foldr and a foldl to a proof that h is a list homomorphism. The effort constructing the proof is thus not wasted, and the resulting program is guaranteed to be correct.
机译:众所周知的第三列表同态定理指出,如果函数h既是foldr又是foldl的实例,则它是一个列表同态。但是,许多先前致力于构造列表同态的工作忽略了以下事实:证明h既是文件夹又是折叠,通常是最难的部分,一旦完成,就已经提供了有关结果列表同构可能是什么的有用提示。在本文中,我们提出了一种新方法:构造关联算子的可能候选者,同时将h既是文件夹又是文件夹的证明转换为h是列表同态的证明。因此,不会浪费构造证明的精力,并且可以保证生成的程序是正确的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号