首页> 外文会议>Rewriting Techniques and Applications >On Normalisation of Infinitary Combinatory Reduction Systems
【24h】

On Normalisation of Infinitary Combinatory Reduction Systems

机译:关于不定式组合归约系统的归一化

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

摘要

For fully-extended, orthogonal infinitary Combinatory Reduction Systems, we prove that terms with perpetual reductions starting from them do not have (head) normal forms. Using this, we show that 1. needed reduction strategies are normalising for fully-extended, orthogonal infinitary Combinatory Reduction Systems, and that 2. weak and strong normalisation coincide for such systems as a whole and, in case reductions are non-erasing, also for terms.
机译:对于完全扩展的正交不定式组合归约系统,我们证明了从它们开始进行永久归约的词语不具有(头部)正规形式。使用此方法,我们表明1.对于完全扩展的正交无限联合组合约简系统,所需的归约策略正在规范化;对于整个此类系统,弱和强归一化是重合的;如果归约是无擦除的,则也是如此。条款。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号