...
首页> 外文期刊>Logical Methods in Computer Science >Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi
【24h】

Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi

机译:直觉后继计算的连续传递样式和强归一化

获取原文

摘要

The intuitionistic fragment of the call-by-name version of Curien andHerbelin's λ--μ-μ~-calculus is isolated and proved stronglynormalising by means of an embedding into the simply-typed lambda-calculus. Ourembedding is a continuation-and-garbage-passing style translation, theinspiring idea coming from Ikeda and Nakazawa's translation of Parigot'sλ-μ-calculus. The embedding strictly simulates reductions while usualcontinuation-passing-style transformations erase permutative reduction steps.For our intuitionistic sequent calculus, we even only need "units of garbage"to be passed. We apply the same method to other calculi, namely successiveextensions of the simply-typed λ-calculus leading to our intuitionisticsystem, and already for the simplest extension we consider (λ-calculuswith generalised application), this yields the first proof of strongnormalisation through a reduction-preserving embedding. The results obtainedextend to second and higher-order calculi.
机译:Curien和Herbelin的λ--μ〜-演算的直呼形式的直觉片段被隔离,并通过嵌入到简单类型的lambda演算中被证明具有很强的归一化性。我们的嵌入是一种延续和传递垃圾的方式,其灵感来自池田和中泽对Parigot的λ-μ微积分的翻译。嵌入严格模拟还原,而通常的连续传递样式转换则消除了置换的还原步骤。对于直观的后续演算,我们甚至只需要传递“垃圾单元”即可。我们将相同的方法应用于其他计算,即导致我们的直觉系统的简单类型λ微积分的连续扩展,对于我们考虑的最简单扩展(具有广义应用的λ微积分),这通过归约得到了第一个强规范化证明。 -保留嵌入。获得的结果扩展到二阶和更高阶的结石。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号