diff options
| author | simonpj@microsoft.com <unknown> | 2010-09-13 09:50:48 +0000 |
|---|---|---|
| committer | simonpj@microsoft.com <unknown> | 2010-09-13 09:50:48 +0000 |
| commit | d2ce0f52d42edf32bb9f13796e6ba6edba8bd516 (patch) | |
| tree | 1a0792f7eb186fa3d71a02f4a21da3daae3466bb /compiler/utils/Digraph.lhs | |
| parent | 0084ab49ab3c0123c4b7f9523d092af45bccfd41 (diff) | |
| download | haskell-d2ce0f52d42edf32bb9f13796e6ba6edba8bd516.tar.gz | |
Super-monster patch implementing the new typechecker -- at last
This major patch implements the new OutsideIn constraint solving
algorithm in the typecheker, following our JFP paper "Modular type
inference with local assumptions".
Done with major help from Dimitrios Vytiniotis and Brent Yorgey.
Diffstat (limited to 'compiler/utils/Digraph.lhs')
| -rw-r--r-- | compiler/utils/Digraph.lhs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/compiler/utils/Digraph.lhs b/compiler/utils/Digraph.lhs index a2bb21572d..2ed39332c6 100644 --- a/compiler/utils/Digraph.lhs +++ b/compiler/utils/Digraph.lhs @@ -76,7 +76,7 @@ Note [Nodes, keys, vertices] \begin{code} data Graph node = Graph { - gr_int_graph :: IntGraph, + gr_int_graph :: IntGraph, gr_vertex_to_node :: Vertex -> node, gr_node_to_vertex :: node -> Maybe Vertex } |