首页> 外文期刊>Journal of logic and computation >Stable Results and Relative Normalization
【24h】

Stable Results and Relative Normalization

机译:稳定的结果和相对标准化

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

摘要

In orthogonal expression reduction systems, a common generalization of term rewriting and λ-calculus, we extend the concepts of normalization and needed reduction by considering, instead of the set of normal forms, a set S of 'results'. When S satisfies some simple axioms which we call stability, we prove the corresponding generalizations of some fundamental theorems: the existence of needed reduction, that needed reduction is normalizing, the existence of minimal normalizing reductions, and the optimality theorem.
机译:在正交表达式归约系统(术语重写和λ演算的通用概括)中,我们通过考虑“结果”的集合S(而不是正规集)来扩展归一化和需要归约的概念。当S满足一些我们称为稳定性的简单公理时,我们证明了一些基本定理的对应推广:所需约简的存在,所需约简的归一化,最小归一化约简的存在以及最优性定理。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号