pds
Copyright(c) Julian Grove and Aaron Steven White 2025
LicenseMIT
Maintainerjulian.grove@gmail.com
Safe HaskellSafe-Inferred
LanguageHaskell2010

Framework.Grammar.Lexica.SynSem.Convenience

Description

 
Synopsis

Some convenience functions

data PairFun (f :: Type -> Type) (g :: Type -> Type) a b Source #

Constructors

PairFun 

Fields

Instances

Instances details
(Show (f a), Show (g b)) => Show (PairFun f g a b) Source # 
Instance details

Defined in Framework.Grammar.Lexica.SynSem.Convenience

Methods

showsPrec :: Int -> PairFun f g a b -> ShowS #

show :: PairFun f g a b -> String #

showList :: [PairFun f g a b] -> ShowS #

(Eq (f a), Eq (g b)) => Eq (PairFun f g a b) Source # 
Instance details

Defined in Framework.Grammar.Lexica.SynSem.Convenience

Methods

(==) :: PairFun f g a b -> PairFun f g a b -> Bool #

(/=) :: PairFun f g a b -> PairFun f g a b -> Bool #

compDepth :: String -> Cat -> Cat -> PairFun Maybe Maybe (Int, Cat) (Int, Cat) Source #

compDepthEnglish :: String -> Cat -> Cat -> PairFun Maybe Maybe (Int, Cat) (Int, Cat) Source #

genComp :: [Term] Source #

genSub :: [Term] Source #

flipp :: Term -> Term Source #

combineR :: SynSem -> SynSem -> [SynSem] Source #

combineL :: SynSem -> SynSem -> [SynSem] Source #