Parallel Reduction in Resource Lambda-Calculus

Authors:
Michele Pagani;Paolo Tranquilli
Affiliations:
Dipartimento di Informatica, Università di Torino,;Laboratoire PPS, Université Paris Diderot,
Venue:
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Year:
2009

Citing 6
Cited 7

Linear logic

Theoretical Computer Science
Parallel reductions in &lgr;-calculus

Information and Computation
The differential Lambda-calculus

Theoretical Computer Science
Differential interaction nets

Theoretical Computer Science - Logic, language, information and computation
Uniformity and the Taylor expansion of ordinary lambda-terms

Theoretical Computer Science
Böhm trees, krivine's machine and the taylor expansion of lambda-terms

CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers

Categorical Models for Simply Typed Resource Calculi

Electronic Notes in Theoretical Computer Science (ENTCS)
Resource combinatory algebras

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Linearity, Non-determinism and Solvability

Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
Böhm's theorem for resource lambda calculus through Taylor expansion

TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Constructing differential categories and deconstructing categories of games

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Solvability in resource lambda-calculus

FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Constructing differential categories and deconstructing categories of games

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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-Löf to achieve confluence. Then, slightly generalizing a technique by Takahashi, we obtain a standardization result.