Copyright	(C) 2017-18 Jakub Daniel
License	BSD-style (see the file LICENSE)
Maintainer	Jakub Daniel <jakub.daniel@protonmail.com>
Stability	experimental
Safe Haskell	Safe
Language	Haskell2010

Data.Expression.Utils.Indexed.Foldable

Description

Synopsis

Documentation

Type constructors (usually functors) that can be folded

Minimal complete definition

Methods

ifold :: Monoid m => f (Const m) i' -> Const m i' Source #

Instances

IFoldable Sort ArrayF Source #
Methods ifold :: Monoid m => f (Const ArrayF m) i' -> Const ArrayF m i' Source #
IFoldable Sort ArithmeticF Source #
Methods ifold :: Monoid m => f (Const ArithmeticF m) i' -> Const ArithmeticF m i' Source #
IFoldable Sort NegationF Source #
Methods ifold :: Monoid m => f (Const NegationF m) i' -> Const NegationF m i' Source #
IFoldable Sort DisjunctionF Source #
Methods ifold :: Monoid m => f (Const DisjunctionF m) i' -> Const DisjunctionF m i' Source #
IFoldable Sort ConjunctionF Source #
Methods ifold :: Monoid m => f (Const ConjunctionF m) i' -> Const ConjunctionF m i' Source #
IFoldable Sort (EqualityF Sort) Source #
Methods ifold :: Monoid m => f (Const (EqualityF Sort) m) i' -> Const (EqualityF Sort) m i' Source #
IFoldable Sort (ExistentialF v) Source #
Methods ifold :: Monoid m => f (Const (ExistentialF v) m) i' -> Const (ExistentialF v) m i' Source #
IFoldable Sort (UniversalF v) Source #
Methods ifold :: Monoid m => f (Const (UniversalF v) m) i' -> Const (UniversalF v) m i' Source #
IFoldable Sort (VarF (Sort -> *)) Source #
Methods ifold :: Monoid m => f (Const (VarF (Sort -> )) m) i' -> Const (VarF (Sort -> )) m i' Source #
(IFoldable i f, IFoldable i g) => IFoldable i ((:+:) i (i -> *) f g) Source #
Methods ifold :: Monoid m => f (Const ((i :+: (i -> )) f g) m) i' -> Const ((i :+: (i -> )) f g) m i' Source #