Discokitty

This module exports all basic modules of the Discokitty library. Please note that models and examples should be imported separately.

Documentation

class Dim a where

Methods

dim :: a -> Int

In the meaning space, states can have a given number of output wires. This function takes an state and should output the number of output wires it has.

Instances

Dim UniverseN

Defined in Discokitty.Examples.LesJustesUniverse

Methods

dim :: UniverseN -> Int

Dim (Words (Rel u))

Defined in Discokitty.Models.Rel

Methods

dim :: Words (Rel u) -> Int

Dim (Rel u)

Defined in Discokitty.Models.Rel

Methods

dim :: Rel u -> Int

Dim (Vectorspace u m)

Defined in Discokitty.Models.Vectorspaces

Methods

dim :: Vectorspace u m -> Int

class HasCups m where

Methods

cup :: Int -> m -> m -> m

Given an integer, performs that number of cups between the two meaning spaces. In a monoidal category, this should be the composition of the tensor product of two states with a certain number of cups.

cunit :: m

Neutral element for the cup operation. This could be given by the identity morphism (state).

Instances

Ord u => HasCups (Rel u)

Defined in Discokitty.Models.Rel

Methods

cup :: Int -> Rel u -> Rel u -> Rel u

cunit :: Rel u

(Ord u, Eq u, Semiring m) => HasCups (Vectorspace u m)

Defined in Discokitty.Models.Vectorspaces

Methods

cup :: Int -> Vectorspace u m -> Vectorspace u m -> Vectorspace u m

cunit :: Vectorspace u m

data Type

Lambek basic grammatical types.

Constructors

N

S

L Type

R Type

Instances

Eq Type

Defined in Discokitty.Lambek

Methods

(==) :: Type -> Type -> Bool

(/=) :: Type -> Type -> Bool

Ord Type

Defined in Discokitty.Lambek

Methods

compare :: Type -> Type -> Ordering

(<) :: Type -> Type -> Bool

(<=) :: Type -> Type -> Bool

(>) :: Type -> Type -> Bool

(>=) :: Type -> Type -> Bool

max :: Type -> Type -> Type

min :: Type -> Type -> Type

Show Type

Defined in Discokitty.Lambek

Methods

showsPrec :: Int -> Type -> ShowS

show :: Type -> String

showList :: [Type] -> ShowS

type Lambek = [Type]

A Lambek pregroup type.

agreeOn :: Int -> Lambek -> Lambek -> Bool

Checks if two Lambek types can be reduced a given number of steps.

data Words m

A word is given by a meaning and a grammatical type. The Words type is parameterized over the meaning type.

Constructors

Words

Fields

• meaning :: m
• grammar :: Lambek
• text :: String

Instances

Show m => Show (Words m)

Defined in Discokitty.Words

Methods

showsPrec :: Int -> Words m -> ShowS

show :: Words m -> String

showList :: [Words m] -> ShowS

Dim (Words (Rel u))

Defined in Discokitty.Models.Rel

Methods

dim :: Words (Rel u) -> Int

sentence :: HasCups m => [Words m] -> [Words m]

Concatenates a list of words outputting all possible grammatical reductions.

concatenate :: HasCups m => Words m -> Words m -> [Words m]

emptyWord :: HasCups m => Words m

Empty word. Unit for concatenation of words.

(@@@) :: [Words m] -> Lambek -> [Words m]

Filters a list of words by grammatical type.