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

文章基本信息

  • 标题:Completeness of algebraic CPS simulations
  • 本地全文:下载
  • 作者:Ali Assaf ; Simon Perdrix
  • 期刊名称:Electronic Proceedings in Theoretical Computer Science
  • 电子版ISSN:2075-2180
  • 出版年度:2011
  • 卷号:88
  • 页码:16-27
  • DOI:10.4204/EPTCS.88.2
  • 出版社:Open Publishing Association
  • 摘要:The algebraic lambda calculus and the linear algebraic lambda calculus are two extensions of the classical lambda calculus with linear combinations of terms. They arise independently in distinct contexts: the former is a fragment of the differential lambda calculus, the latter is a candidate lambda calculus for quantum computation. They differ in the handling of application arguments and algebraic rules. The two languages can simulate each other using an algebraic extension of the well-known call-by-value and call-by-name CPS translations. These simulations are sound, in that they preserve reductions. In this paper, we prove that the simulations are actually complete, strengthening the connection between the two languages.
国家哲学社会科学文献中心版权所有