Safe Haskell	Safe-Inferred
Language	Haskell2010

LAM.CanTrim

Description

Trimming closures.

Synopsis

class CanTrim term (t :: Type -> Type) where
- trim :: Closure term t -> Closure term t
collectHeap :: forall (t :: Type -> Type) term. Traversable t => RState IORef term t -> IO (HeapRefs term t)

Documentation

class CanTrim term (t :: Type -> Type) where #

CanTrim for a term type term and container type t provides a function to trim the enivronment of a closure, i.e. to remove all unused variables. If the term type uses DeBruijn indices, this also has to adjust the indices for the new environment.

Methods

trim :: Closure term t -> Closure term t #

Instances

Instances details

CanTrim DBTTerm0 NamedList #
Instance details Defined in LAM.Exec.DBTrimPure Methods trim :: Closure DBTTerm0 NamedList -> Closure DBTTerm0 NamedList #
CanTrim DBTTerm0 [] #
Instance details Defined in LAM.Exec.DBTrimPure Methods trim :: Closure DBTTerm0 [] -> Closure DBTTerm0 [] #
CanTrim DBTerm NamedList #
Instance details Defined in LAM.CanTrim Methods trim :: Closure DBTerm NamedList -> Closure DBTerm NamedList #
CanTrim DBTerm Seq #
Instance details Defined in LAM.Exec.DBNoTrimPure Methods trim :: Closure DBTerm Seq -> Closure DBTerm Seq #
CanTrim DBTerm Vector #
Instance details Defined in LAM.Exec.DBNoTrimPure Methods trim :: Closure DBTerm Vector -> Closure DBTerm Vector #
CanTrim DBTerm [] #
Instance details Defined in LAM.Exec.DBNoTrimPure Methods trim :: Closure DBTerm [] -> Closure DBTerm [] #
CanTrim Term NamedList #
Instance details Defined in LAM.CanTrim Methods trim :: Closure Term NamedList -> Closure Term NamedList #
CanTrim Term Trie #
Instance details Defined in LAM.CanTrim Methods trim :: Closure Term Trie -> Closure Term Trie #

collectHeap :: forall (t :: Type -> Type) term. Traversable t => RState IORef term t -> IO (HeapRefs term t) #

Resolve all heap pointers (i.e. IORefs) of a RState.