Parallel Reduction in Type Free Lambda-mu-Calculus

概要

論文の詳細を見る
The typed Lambda-mu-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 Lambda-mu-calculus by "Tait-and-Martin-Löf" method. However, the diamondproperty does not hold for his parallel reduction.The confluence for type-free Lambda-mu-calculus cannot be derived from that of the typed Lambda-mu-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 consideredas 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 Lambda-mu-calculus. The diamond property of the new parallel reduction is also applicable to a call-by-value version of the Lambda-mu-calculus containing thesymmetric structural reduction rule.