Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
An internal module that defines functions for deciding equality of values of data types that encode things with binders.
Synopsis
- newtype LR a = LR {
- unLR ∷ a
- newtype RL a = RL {
- unRL ∷ a
- type EqRename ren = RenameT (Bilateral ren) Maybe ()
- type ScopedEqRename = EqRename ScopedRenaming
- runEqRename ∷ Monoid ren ⇒ EqRename ren → Bool
- withTwinBindings ∷ (HasRenaming ren unique, HasUnique name unique, Monad m) ⇒ name → name → RenameT (Bilateral ren) m c → RenameT (Bilateral ren) m c
- eqNameM ∷ (HasRenaming ren unique, HasUnique name unique, Eq unique) ⇒ name → name → EqRename ren
- eqM ∷ Eq a ⇒ a → a → EqRename ren
Documentation
From left to right.
From right to left.
type ScopedEqRename = EqRename ScopedRenaming Source #
withTwinBindings ∷ (HasRenaming ren unique, HasUnique name unique, Monad m) ⇒ name → name → RenameT (Bilateral ren) m c → RenameT (Bilateral ren) m c Source #
Record that two names map to each other.