论文信息 - Parallel Reduction in Resource Lambda-Calculus

Parallel Reduction in Resource Lambda-Calculus

We study the resource calculus --- the non-lazy version of Boudol's *** -calculus with resources. In such a calculus arguments may be finitely available and mixed, giving rise to nondeterminism, modelled by a formal sum. We define parallel reduction in resource calculus and we apply, in such a nondeterministic setting, the technique by Tait and Martin-Lof to achieve confluence. Then, slightly generalizing a technique by Takahashi, we obtain a standardization result.

Michele Pagani | Paolo Tranquilli

[1] Thomas Ehrhard,et al. Uniformity and the Taylor expansion of ordinary lambda-terms , 2008, Theor. Comput. Sci..

[2] Paolo Tranquilli,et al. Nets between determinism and nondeterminism , 2009 .

[3] Thomas Ehrhard,et al. Böhm Trees, Krivine's Machine and the Taylor Expansion of Lambda-Terms , 2006, CiE.

[4] Thomas Ehrhard,et al. Differential Interaction Nets , 2005, WoLLIC.

[5] Patrick Lincoln,et al. Linear logic , 1992, SIGA.

[6] Robin Milner,et al. Functions as processes , 1990, Mathematical Structures in Computer Science.

[7] Laurent Regnier,et al. The differential lambda-calculus , 2003, Theor. Comput. Sci..

[8] Benedikt Löwe,et al. Logical Approaches to Computational Barriers: CiE 2006 , 2007, J. Log. Comput..

[9] Gérard Boudol,et al. The Lambda-Calculus with Multiplicities (Abstract) , 1993, CONCUR.

[10] Masako Takahashi. Parallel Reductions in lambda-Calculus , 1995, Inf. Comput..

[11] Paolo Tranquilli,et al. Intuitionistic differential nets and lambda-calculus , 2011, Theor. Comput. Sci..