Modulehnix-0.17.0Haskell2010

Nix.Normal

Code for normalization (reduction into a normal form) of Nix expressions. Nix language allows recursion, so some expressions do not converge. And so do not converge into a normal form.

Synopsis

newtype NormalLoop
value normalizeValue
value normalizeValueF
value normalForm
value normalForm_
value opaqueVal
value stubCycles
value thunkStubVal
value bindComputedThunkOrStub
value removeEffects
value dethunk

Packagehnix-0.17.0
Exports11
LanguageHaskell2010
LicenceBSD-3-Clause
SourceNormal.hs

newtypenewtype NormalLoop t (f :: Type -> Type) (m :: Type -> Type)

Constructors

NormalLoop (NValue t f m)

Instances2Show, Exception

(Comonad f, Applicative f, Show t) => Show (NormalLoop t f m)Defined in hnix-0.17.0 · Nix.Normal
MonadDataErrorContext t f m => Exception (NormalLoop t f m)Defined in hnix-0.17.0 · Nix.Normal

valuenormalizeValue

:: (Framed e m, MonadThunk t m (NValue t f m), MonadDataErrorContext t f m, Ord (ThunkId m))
=> NValue t f m
-> m (NValue t f m)

Source#

Normalize the value as much as possible, leaving only detected cycles.

valuenormalizeValueF

:: (Framed e m, MonadThunk t m (NValue t f m), MonadDataErrorContext t f m, Ord (ThunkId m))
=> forall r. t -> (NValue t f m -> m r) -> m r
-> NValue t f m
-> m (NValue t f m)

Source#

Normalization HOF (functorial) version of normalizeValue. Accepts the special thunk operatingforcingnirmalizing function & internalizes it.

valuenormalForm

:: (Framed e m, MonadThunk t m (NValue t f m), MonadDataErrorContext t f m, HasCitations m (NValue t f m) t, HasCitations1 m (NValue t f m) f, Ord (ThunkId m))
=> NValue t f m
-> m (NValue t f m)

Source#

Normalize value. Detect cycles. If cycles were detected - put a stub on them.

valuenormalForm_

:: (Framed e m, MonadThunk t m (NValue t f m), MonadDataErrorContext t f m, Ord (ThunkId m))
=> NValue t f m
-> m ()

Source#

Monadic context of the result.

valueopaqueVal :: NVConstraint f => NValue t f m

valuestubCycles

:: (MonadDataContext f m, HasCitations m (NValue t f m) t, HasCitations1 m (NValue t f m) f)
=> NValue t f m
-> NValue t f m

Source#

Detect cycles & stub them.

valuethunkStubVal :: NVConstraint f => NValue t f m

valuebindComputedThunkOrStub

:: (NVConstraint f, MonadThunk t m (NValue t f m))
=> NValue t f m -> m a
-> t
-> m a

Source#

Check if thunk t is computed, then bind it into first arg. else bind the thunk stub val.

valueremoveEffects

:: (MonadThunk t m (NValue t f m), MonadDataContext f m)
=> NValue t f m
-> m (NValue t f m)

valuedethunk

:: (MonadThunk t m (NValue t f m), MonadDataContext f m)
=> t
-> m (NValue t f m)