CurryInfo: dimacs-3.0.0 / Dimacs.Scanner.keyword

definition:
keyword :: String -> Token
keyword k = maybe (error $ "unknown keyword: " ++ k) id (lookup (map toLower k) keywords)
demand:
no demanded arguments
deterministic:
deterministic operation
failfree:
_
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{(_) |-> _}
name:
keyword
precedence:
no precedence defined
result-values:
_
signature:
String -> Token
solution-complete:
operation might suspend on free variables
terminating:
possibly non-terminating
totally-defined:
possibly non-reducible on same data term