首页    期刊浏览 2024年11月25日 星期一
登录注册

文章基本信息

  • 标题:An Abstract Factorization Theorem for Explicit Substitutions
  • 本地全文:下载
  • 作者:Beniamino Accattoli
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2012
  • 卷号:15
  • 页码:6-21
  • DOI:10.4230/LIPIcs.RTA.2012.6
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:We study a simple form of standardization, here called factorization, for explicit substitutions calculi, i.e. lambda-calculi where beta-reduction is decomposed in various rules. These calculi, despite being non-terminating and non-orthogonal, have a key feature: each rule terminates when considered separately. It is well-known that the study of rewriting properties simplifies in presence of termination (e.g. confluence reduces to local confluence). This remark is exploited to develop an abstract theorem deducing factorization from some axioms on local diagrams. The axioms are simple and easy to check, in particular they do not mention residuals. The abstract theorem is then applied to some explicit substitution calculi related to Proof-Nets. We show how to recover standardization by levels, we model both call-by-name and call-by-value calculi and we characterize linear head reduction via a factorization theorem for a linear calculus of substitutions.
  • 关键词:lambda-calculus; Standardization; Explicit Substitutions; Abstract rewriting; Diagrammatic reasoning
国家哲学社会科学文献中心版权所有