Top-1.7: Constraint solving framework employed by the Helium Compiler.

Safe HaskellSafe-Infered

Top.Implementation.TypeGraph.Basics

Description

 

Documentation

newtype VertexId Source

Constructors

VertexId Int 

Instances

type VertexInfo = (VertexKind, Maybe Tp)Source

data VertexKind Source

Constructors

VVar 
VCon String 
VApp VertexId VertexId 

Instances

vertexIdToTp :: VertexId -> TpSource

data EdgeId Source

Constructors

EdgeId VertexId VertexId EdgeNr 

Instances

newtype EdgeNr Source

Constructors

EdgeNrX Int 

Instances

data ChildSide Source

Constructors

LeftChild 
RightChild 

Instances

makeEdgeNr :: Int -> EdgeNrSource

impliedEdgeNr :: EdgeNrSource

data ParentChild Source

Constructors

ParentChild 

Fields

parent :: VertexId
 
child :: VertexId
 
childSide :: ChildSide
 

Instances

type TypeGraphPath info = Path (EdgeId, PathStep info)Source

data PathStep info Source

Constructors

Initial info 
Implied ChildSide VertexId VertexId 
Child ChildSide 

Instances

Show (PathStep info) 

newtype Clique Source

Constructors

CliqueX [ParentChild] 

Instances

type CliqueList = [Clique]Source

isSubsetClique :: Clique -> Clique -> BoolSource

isDisjointClique :: Clique -> Clique -> BoolSource

cliqueRepresentative :: Clique -> VertexIdSource

triplesInClique :: Clique -> [ParentChild]Source

childrenInClique :: Clique -> [VertexId]Source

mergeCliques :: CliqueList -> CliqueSource

makeClique :: [ParentChild] -> CliqueSource

combineCliqueList :: CliqueList -> CliqueList -> CliqueListSource