Changes between Version 35 and Version 36 of TypeFunctionsSolving


Ignore:
Timestamp:
Aug 7, 2008 4:37:05 AM (6 years ago)
Author:
chak
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • TypeFunctionsSolving

    v35 v36  
    11= Normalising and Solving Type Equalities = 
    22 
    3 The following is based on ideas for the new, post-ICFP'08 solving algorithm described in CVS `papers/type-synonym/new-single.tex`.  Most of the code is in the module `TcTyFuns`. 
     3The following is based on ideas for the new, post-ICFP'08 solving algorithm described in CVS `papers/type-synonym/new-single.tex`.  A revised version of `new-single.tex` that integrates the core ideas from this wiki page is in `papers/type-synonym/normalised_equations_algorithm.tex`.  Most of the code is in the module `TcTyFuns`. 
    44 
    55 
     
    1818== Overall algorithm == 
    1919 
    20 The overall algorithm is as in `new-single.tex`, namely 
     20The overall structure is as in `new-single.tex`, namely 
    2121 1. normalise all constraints (both locals and wanteds), 
    2222 2. solve the wanteds, and 
    2323 3. finalise. 
    24  
     24However, the three phases differ in important ways.  In particular, normalisation includes decompositions & the occurs check, and we don't instantiate any flexible type variables before we finalise (i.e., solving is purely local). 
    2525 
    2626== Normal equalities ==