Program Verification - Translation rule

AI Thread Summary
The discussion centers on understanding the translation rule in program verification, specifically how the left-hand side (LHS) of the equation equals the right-hand side (RHS). The user is confused about the appearance of R[k:=f.j] and T[k:=f.j] on the RHS. Clarification is sought on the derivation of these terms and their relation to the functions f and g, which are defined as inverses. The importance of proper notation and readability in LaTeX is also highlighted, as it affects the ability to comprehend the mathematical expressions. Overall, the thread emphasizes the need for a clearer explanation of the translation rule's application.
craigs
Messages
2
Reaction score
0
Hi

I am doing a course on Program verification and am having trouble with the properties of summation, more specifically the rule of translation:

"Suppose function f maps values of type J to values of type K, and suppose g is a function that maps values of type K to values of type J. suppose further that f and g are inverses. That is, suppose that, for all j\inJ and k\inK, (f.j=k) \equiv (j=g.k)

\left\langle \Sigmak\inK:R:T\right\rangle = \left\langle \Sigmaj\inJ:R[k:=f.j]:T[k:=f.j]\right\rangle

My question: I actually do not understand how the LHS of the equation equals the RHS.
Perhaps more specifically I am not sure how R[k:=f.j] and T[k:=f.j] appears on the right side, where does it come from?
 
Physics news on Phys.org
craigs said:
Hi

I am doing a course on Program verification and am having trouble with the properties of summation, more specifically the rule of translation:

"Suppose function f maps values of type J to values of type K, and suppose g is a function that maps values of type K to values of type J. suppose further that f and g are inverses. That is, suppose that, for all j\inJ and k\inK, (f.j=k) \equiv (j=g.k)

\left\langle \Sigmak\inK:R:T\right\rangle = \left\langle \Sigmaj\inJ:R[k:=f.j]:T[k:=f.j]\right\rangle

My question: I actually do not understand how the LHS of the equation equals the RHS.
Perhaps more specifically I am not sure how R[k:=f.j] and T[k:=f.j] appears on the right side, where does it come from?
Please fix your LaTeX so that it is readable. I can't tell what you're trying to say, so I can't fix it.
 
Sorry. Here is my next attempt:

"Suppose function f maps values of type J to values of type K, and suppose g is a function that maps values of type K to values of type J. suppose further that f and g are inverses. That is, suppose that, for all j\inJ and k\inK, (f.j=k) \equiv (j=g.k)

\langle \Sigmak\inK:R:T\rangle = \langle \Sigmaj\inJ:R[k:=f.j]:T[k:=f.j]\rangle

My question: I actually do not understand how the LHS of the equation equals the RHS.
Perhaps more specifically I am not sure how R[k:=f.j] and T[k:=f.j] appears on the right side, where does it come from?
 
Back
Top