Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus

Details Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus

2012-03-03

arxiv.org/abs/1203.0670v2

LMCS 8 (1:28) 2012

Computer Science

Logic in Computer Science

Scientific paper

10.2168/LMCS-8(1:28)2012

Inspired by a recent graphical formalism for lambda-calculus based on linear logic technology, we introduce an untyped structural lambda-calculus, called lambda j, which combines actions at a distance with exponential rules decomposing the substitution by means of weakening, contraction and derelicition. First, we prove some fundamental properties of lambda j such as confluence and preservation of beta-strong normalisation. Second, we add a strong bisimulation to lambda j by means of an equational theory which captures in particular Regnier's sigma-equivalence. We then complete this bisimulation with two more equations for (de)composition of substitutions and we prove that the resulting calculus still preserves beta-strong normalization. Finally, we discuss some consequences of our results.

Affiliated with

Also associated with

No associations

Rating

Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-345742