Computer Science – Programming Languages
Scientific paper
2010-12-22
EPTCS 42, 2010, pp. 39-53
Computer Science
Programming Languages
In Proceedings UNIF 2010, arXiv:1012.4554
Scientific paper
10.4204/EPTCS.42.4
Correctness of program transformations in extended lambda calculi with a contextual semantics is usually based on reasoning about the operational semantics which is a rewrite semantics. A successful approach to proving correctness is the combination of a context lemma with the computation of overlaps between program transformations and the reduction rules, and then of so-called complete sets of diagrams. The method is similar to the computation of critical pairs for the completion of term rewriting systems. We explore cases where the computation of these overlaps can be done in a first order way by variants of critical pair computation that use unification algorithms. As a case study we apply the method to a lambda calculus with recursive let-expressions and describe an effective unification algorithm to determine all overlaps of a set of transformations with all reduction rules. The unification algorithm employs many-sorted terms, the equational theory of left-commutativity modelling multi-sets, context variables of different kinds and a mechanism for compactly representing binding chains in recursive let-expressions.
Rau Conrad
Schmidt-Schauß Manfred
No associations
LandOfFree
Towards Correctness of Program Transformations Through Unification and Critical Pair Computation 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 Towards Correctness of Program Transformations Through Unification and Critical Pair Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards Correctness of Program Transformations Through Unification and Critical Pair Computation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-581929