Parallel Reduction in Type Free lambda/mu-Calculus
Parallel Reduction in Type Free lambda/mu-Calculus
复制标题
无类型 lambda/mu 微积分的并行归约
DOI:
10.1016/s1571-0661(04)80878-8
复制
发表时间:
2000
期刊:
影响因子:
--
通讯作者:
藤田 憲悦
中科院分区:
文献类型:
--
作者:
K. Baba;馬場 謙介;S. Hirokawa;廣川 佐千男;Ken;藤田 憲悦
The typed λμ-calculus is known to be strongly normalizing and weakly Church-Rosser, and hence becomes confluent. In fact, Parigot formulated a parallel reduction to prove confluence of the typed λμ-calculus by “Tait-and-Martin-Löf” method. However, the diamond property does not hold for his parallel reduction. The confluence for type-free λμ-calculus cannot be derived from that of the typed λμ-calculus and is not confirmed yet as far as we know. We analyze granularity of the reduction rules, and then introduce a new parallel reduction such that both renaming reduction and consecutive structural reductions are considered as one step parallel reduction. It is shown that the new formulation of parallel reduction has the diamond property, which yields a correct proof of the confluence for type free λμ-calculus. The diamond property of the new parallel reduction is also applicable to a call-by-value version of the λμ-calculus containing the symmetric structural reduction rule.