Strict Ideal Completions of the Lambda Calculus

P. Bahr
{"title":"Strict Ideal Completions of the Lambda Calculus","authors":"P. Bahr","doi":"10.4230/LIPIcs.FSCD.2018.8","DOIUrl":null,"url":null,"abstract":"The infinitary lambda calculi pioneered by Kennaway et al. extend the basic lambda calculus by metric completion to infinite terms and reductions. Depending on the chosen metric, the resulting infinitary calculi exhibit different notions of strictness. To obtain infinitary normalisation and infinitary confluence properties for these calculi, Kennaway et al. extend $\\beta$-reduction with infinitely many `$\\bot$-rules', which contract meaningless terms directly to $\\bot$. Three of the resulting B\\\"ohm reduction calculi have unique infinitary normal forms corresponding to B\\\"ohm-like trees. \nIn this paper we develop a corresponding theory of infinitary lambda calculi based on ideal completion instead of metric completion. We show that each of our calculi conservatively extends the corresponding metric-based calculus. Three of our calculi are infinitarily normalising and confluent; their unique infinitary normal forms are exactly the B\\\"ohm-like trees of the corresponding metric-based calculi. Our calculi dispense with the infinitely many $\\bot$-rules of the metric-based calculi. The fully non-strict calculus (called $111$) consists of only $\\beta$-reduction, while the other two calculi (called $001$ and $101$) require two additional rules that precisely state their strictness properties: $\\lambda x.\\bot \\to \\bot$ (for $001$) and $\\bot\\,M \\to \\bot$ (for $001$ and $101$).","PeriodicalId":284975,"journal":{"name":"International Conference on Formal Structures for Computation and Deduction","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Formal Structures for Computation and Deduction","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.FSCD.2018.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

The infinitary lambda calculi pioneered by Kennaway et al. extend the basic lambda calculus by metric completion to infinite terms and reductions. Depending on the chosen metric, the resulting infinitary calculi exhibit different notions of strictness. To obtain infinitary normalisation and infinitary confluence properties for these calculi, Kennaway et al. extend $\beta$-reduction with infinitely many `$\bot$-rules', which contract meaningless terms directly to $\bot$. Three of the resulting B\"ohm reduction calculi have unique infinitary normal forms corresponding to B\"ohm-like trees. In this paper we develop a corresponding theory of infinitary lambda calculi based on ideal completion instead of metric completion. We show that each of our calculi conservatively extends the corresponding metric-based calculus. Three of our calculi are infinitarily normalising and confluent; their unique infinitary normal forms are exactly the B\"ohm-like trees of the corresponding metric-based calculi. Our calculi dispense with the infinitely many $\bot$-rules of the metric-based calculi. The fully non-strict calculus (called $111$) consists of only $\beta$-reduction, while the other two calculi (called $001$ and $101$) require two additional rules that precisely state their strictness properties: $\lambda x.\bot \to \bot$ (for $001$) and $\bot\,M \to \bot$ (for $001$ and $101$).
λ微积分的严格理想补全
Kennaway等人开创的无限λ演算将基本λ演算通过度量补全扩展到无限项和约简。根据所选择的度量,所得到的无穷微积分表现出不同的严格性概念。为了获得这些微积分的无穷归一化和无穷合流性质,Kennaway等人将$\beta$ -约简扩展为无穷多个“$\bot$ -规则”,这些规则将无意义的项直接压缩到$\bot$。所得的三个Böhm约简演算具有对应于Böhm-like树的唯一无穷范式。本文提出了基于理想补全而不是度量补全的无限λ演算的相应理论。我们证明了我们的每个演算都保守地扩展了相应的基于度量的演算。我们的演算中有三个是无限归一化和汇合的;它们独特的无穷范式正是相应的基于度量的演算的Böhm-like树。我们的演算省去了基于度量的演算的无穷多$\bot$规则。完全非严格演算(称为$111$)只包括$\beta$ -reduction,而其他两个演算(称为$001$和$101$)需要两个额外的规则来精确地声明它们的严格属性:$\lambda x.\bot \to \bot$(用于$001$)和$\bot\,M \to \bot$(用于$001$和$101$)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信