首页> 外文期刊>Logical Methods in Computer Science >Call-by-Value and Call-by-Name Dual Calculi with Inductive and Coinductive Types
【24h】

Call-by-Value and Call-by-Name Dual Calculi with Inductive and Coinductive Types

机译:归纳和共归类型的按值调用和按名称调用对偶计算

获取原文
           

摘要

This paper extends the dual calculus with inductive types and coinductivetypes. The paper first introduces a non-deterministic dual calculus withinductive and coinductive types. Besides the same duality of the original dualcalculus, it has the duality of inductive and coinductive types, that is, theduality of terms and coterms for inductive and coinductive types, and theduality of their reduction rules. Its strong normalization is also proved,which is shown by translating it into a second-order dual calculus. The strongnormalization of the second-order dual calculus is proved by translating itinto the second-order symmetric lambda calculus. This paper then introduces acall-by-value system and a call-by-name system of the dual calculus withinductive and coinductive types, and shows the duality of call-by-value andcall-by-name, their Church-Rosser properties, and their strong normalization.Their strong normalization is proved by translating them into thenon-deterministic dual calculus with inductive and coinductive types.
机译:本文用归纳类型和共归类型扩展了对偶演算。本文首先介绍了归纳和共归类型的不确定性对偶演算。除了原始对偶演算的相同对偶性之外,它还具有归纳和共归类型的对偶性,即归纳和共归类型的项和共项的对偶性以及它们的归约规则的对偶性。还证明了其强大的归一化,将其转换为二阶对偶演算即可证明这一点。通过将二阶对数演算转换为二阶对称lambda演算来证明其强归一化。然后,本文介绍了归纳和共归双重演算类型的按值调用系统和按名称调用系统,并显示了按值调用和按名称调用的对偶性,它们的Church-Rosser属性以及通过将它们转化为归纳和共归类型的非确定对偶演算,证明了它们的强归一化。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号