Computer Science – Logic in Computer Science
Scientific paper
2011-02-18
EPTCS 49, 2011, pp. 1-15
Computer Science
Logic in Computer Science
In Proceedings HOR 2010, arXiv:1102.3465
Scientific paper
10.4204/EPTCS.49.1
This article is devoted to the presentation of lambda_rex, an explicit substitution calculus with de Bruijn indexes and a simple notation. By being isomorphic to lambda_ex - a recent formalism with variable names -, lambda_rex accomplishes simulation of beta-reduction (Sim), preservation of beta-strong normalization (PSN) and meta-confluence (MC), among other desirable properties. Our calculus is based on a novel presentation of lambda_dB, using a swap notion that was originally devised by de Bruijn. Besides lambda_rex, two other indexed calculi isomorphic to lambda_x and lambda_xgc are presented, demonstrating the potential of our technique when applied to the design of indexed versions of known named calculi.
Mendelzon Ariel
Ríos Alejandro
Ziliani Beta
No associations
LandOfFree
Swapping: a natural bridge between named and indexed explicit substitution calculi 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 Swapping: a natural bridge between named and indexed explicit substitution calculi, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Swapping: a natural bridge between named and indexed explicit substitution calculi will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-211403