Changes between Version 48 and Version 49 of TypeFunctionsSolving


Ignore:
Timestamp:
Aug 16, 2008 4:16:06 AM (6 years ago)
Author:
chak
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • TypeFunctionsSolving

    v48 v49  
    4141 * the relation `x < y` is a total order on type variables, where `alpha < a` whenever `alpha` is a flexible and `a` a rigid type variable (otherwise, the total order may be aribitrary). 
    4242 
    43 The second bullet of the where clause is trivially true for equalities of Form (1) and it implies that the left- and right-hand sides are different. 
     43The second bullet of the where clause is trivially true for equalities of Form (1); it also implies that the left- and right-hand sides are different. 
    4444 
    4545Furthermore, we call a variable equality whose left-hand side is a flexible type variable (aka unification variable) a '''flexible variable equality''', and correspondingly, a variable equality whose left-hand side is a rigid type variable (aka skolem variable) a '''rigid variable equality.'''