首页> 外文会议>International Conference on Term Rewriting and Applications(RTA 2007); 20070626-28; Paris(FR) >Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi
【24h】

Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi

机译:明确代换计算的强归一化特征的简单证明

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

摘要

We present a method of lifting to explicit substitution calculi some characterizations of the strongly normalizing terms of λ-calculus by means of intersection type systems. The method is first illustrated by applying to a composition-free calculus of explicit substitutions, yielding a simpler proof than the previous one by Lengrand et al. Then we present a new intersection type system in the style of sequent calculus, and show that it characterizes the strongly normalizing terms of Dyckhoff and Urban's extension of Herbelin's explicit substitution calculus.
机译:我们提出了一种通过相交类型系统将λ演算的强归一化项的某些特征提升为显式替换计算的方法。首先通过应用无组合的显式替换演算来说明该方法,该方法比Lengrand等人的前一种方法更简单。然后,我们以相继演算的方式提出了一个新的交集类型系统,并表明它表征了Dyckhoff的强归一化项和Herbelin的显式替代演算的Urban扩展。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号