Hoogle Search
Within LTS Haskell 24.52 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
No documentation available.
-
language-nix Language.Nix.Path Paths are non-empty lists of identifiers in Nix.
>>> path # [ident # "yo"] Path [Identifier "yo"]
Any attempt to construct the empty path throws an error:>>> :set -XScopedTypeVariables >>> either (\(_::SomeException) -> "empty paths are illegal") show <$> Excpt.try (evaluate (path # [])) "empty paths are illegal"
Paths can be pretty-printed and parsed with the Text class:>>> parse "Path" "foo.\"foo.bar\".bar" :: Path Path [Identifier "foo",Identifier "foo.bar",Identifier "bar"] >>> pPrint (parse "Path" "foo.\"foo\".\"bar\".bar" :: Path) foo.foo.bar.bar
\p -> Just (p :: Path) == parseM "Path" (prettyShow p)
Paths are instances of strings and can be implicitly converted:>>> :set -XOverloadedStrings >>> pPrint $ ("yo.bar" :: Path) yo.bar >>> pPrint $ (" yo . bar" :: Path) yo.barFreaky quoted identifiers are fine throughout:>>> pPrint $ path # ["yo","b\"ar"] yo."b\"ar" >>> pPrint ("\"5ident\"" :: Path) "5ident" >>> pPrint $ path # ["5ident","foo.bar","foo\nbar"] "5ident"."foo.bar"."foo\nbar" PromotedDataName :: Name -> TypeOrDataNamelift-type LiftType No documentation available.
-
We have simple linear functions and simple linear data structures that illustrate the basic concepts of how the type checker of GHC with linear types behaves. The goal of this is to be a ridiculously simple tutorial on the basics of linear types.
-
linear-generics Generics.Linear Used for marking occurrences of the parameter
-
linear-generics Generics.Linear No documentation available.
-
linear-generics Generics.Linear No documentation available.
-
linear-generics Generics.Linear No documentation available.
module Language.Fixpoint.Graph.
Partition This module implements functions to build constraint / kvar dependency graphs, partition them and print statistics about their structure.
module Language.Fixpoint.Horn.
Parse No documentation available.