Safe Haskell	Safe-Inferred
Language	GHC2021

Language.Giml.Types.Infer

Description

Type inference

Our type inference algorithm works in stages:

First, we elaborate the AST and collect constraints. Then, we solve these constraints and get back a substitution. We go over the AST again, replacing the type variables we added in the elaboration stage with concrete types.

The constraints of each group of definitions are solved separately and in order.

Synopsis

module Language.Giml.Types.Infer.Types
data ElabState = ElabState {
- esTypeVarCounter :: Int
- esConstraints :: Constraints
}
generalizeAndClose :: Type -> Type
infer :: MonadBase b b => LogAction b LogMsg -> File InputAnn -> ExceptT TypeErrorA b (File Ann)

Documentation

module Language.Giml.Types.Infer.Types

data ElabState Source #

The state we keep during elaboration.

Constructors

ElabState
Fields esTypeVarCounter :: Int Used to generate unique type variable names. esConstraints :: Constraints The constraints we collect.

generalizeAndClose :: Type -> Type Source #

infer :: MonadBase b b => LogAction b LogMsg -> File InputAnn -> ExceptT TypeErrorA b (File Ann) Source #

Infer the types for all expressions in a source file