Examples of RHS in a sentence
LDAC FormulaLDACx = CCEEx + RDAFx + PTAMx + ES + GREFx + RCE + GAP and:ESx = RHS + MGPwhere:LDACx = Annualized class specific LDAC.
For example, suppose G and H are injective, and consider F2 defined thus:| →type family F2 a = r r atype instance F2 [ a ] = [G a ]type instance F2 (Maybe a) = H a → Int∼Since a list cannot possibly match a function arrow, an equality (F2 σ F2 τ ) can only hold by using the same equation twice; and in both cases individually the RHS determines the LHS because of the injectivity of G and H .
In Section 4.2.2 we dis- cussed the issues that arise when a type family call appears in the RHS of a type instance, such as:type instance F [ a ] = [ G a ]Precisely the same set of issues arises with functional dependen- cies, where the instance declaration would look like:instance G a rg ⇒ F [ a ] [rg ]This instance declaration would fail the coverage condition of (Jones 2000); in effect, Jones does not allow function calls on the RHS.
It is now clear that k0 is not mentioned anywhere in the RHS, and thus we cannot accept it as injective.
Alas, as we saw in Awkward Case 1 (Section 4.1), if the RHS of a type instance can mention a type family, this test is unsound.