【24h】

De Bruijn's syntax and reductional equivalence of λ-terms

机译:De Bruijn的语法和λ项的归约等价

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

摘要

In this paper, a notation influenced by de Bruijn's syntax of the λ-calculus is used to describe canonical forms of terms and an equivalence relation which divides terms into classes according to their reductional behaviour. We show that this notation helps describe canonical forms more elegantly than the classical notation and we establish the desirable properties of our reduction modulo equivalence classes rather than single terms. Finally, we extend the cube consisting of eight type systems with class reduction and show that this extension satisfies all the desirable properties of type systems.
机译:在本文中,受德·布赖恩(Bruijn)语法的λ微积分影响的符号用于描述术语的规范形式和等价关系,该等价关系根据术语的归约行为将其分为几类。我们表明,这种表示法比经典表示法更能优雅地描述规范形式,并且我们建立了归约模当量类而不是单个术语的理想属性。最后,我们扩展了由八个具有类归约类型的类型系统组成的多维数据集,并表明此扩展满足了类型系统的所有理想特性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号