A short proof that adding some permutation rules to <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>β</mml:mi></mml:math> preserves <mml:math altimg="si2.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>S</mml:mi><mml:mi>N</mml:mi></mml:math>-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A short proof that adding some permutation rules to β preserves SN

Published:2011-03 Issue:11 Volume:412 Page:1022-1026
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

David René

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference10 articles.

1. Normalization without reducibility;David;APAL,2001

2. Call-by-value λ-calculus and LJQ;Dyckhoff;Journal of Logic and Computation,2007

3. Postponement, conservation and preservation of strong normalisation for generalised reduction;Kamareddine;Journal of Logic and Computation,2000

4. A.J. Kfoury, J.B. Wells, New notions of reduction and non-semantic proofs of beta-strong normalization in typed lambda-calculi, in: Proc. 10th Ann. IEEE Symp. Logic in Comput. Sci., 1995, pp. 311–321.

5. Computational Lambda-Calculus and Monads;Moggi,1989

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus;Logical Methods in Computer Science;2012-03-27

2. The Permutative λ-Calculus;Logic for Programming, Artificial Intelligence, and Reasoning;2012

3. A note on preservation of strong normalisation in the λ-calculus;Theoretical Computer Science;2011-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP