Safe Haskell	None

Language.Syntactic.Frontend.TupleConstrained

Description

Constrained Syntactic instances for Haskell tuples

Synopsis

Documentation

class TupleSat dom p | dom -> pSource

Type-level function computing the predicate attached to Tuple or Select (whichever appears first) in a domain.

Instances

TupleSat dom2 p => TupleSat (:+: dom1 dom2) p
TupleSat (:+: (:\|\| Tuple p) dom2) p
TupleSat (:+: (:\|\| Select p) dom2) p
TupleSat dom p => TupleSat (:\|\| dom q) p
TupleSat (:\|\| Tuple p) p
TupleSat (:\|\| Select p) p
TupleSat dom p => TupleSat (:\| dom q) p

TupleSat dom2 p => TupleSat (:+: dom1 dom2) p
TupleSat (:+: (:\|\| Tuple p) dom2) p
TupleSat (:+: (:\|\| Select p) dom2) p
TupleSat dom p => TupleSat (:\|\| dom q) p
TupleSat (:\|\| Tuple p) p
TupleSat (:\|\| Select p) p
TupleSat dom p => TupleSat (:\| dom q) p