aboutsummaryrefslogtreecommitdiff
path: root/hoogle-test
diff options
context:
space:
mode:
Diffstat (limited to 'hoogle-test')
-rw-r--r--hoogle-test/ref/Bug873/test.txt27
-rw-r--r--hoogle-test/src/Bug806/Bug806.hs1
-rw-r--r--hoogle-test/src/Bug873/Bug873.hs6
3 files changed, 0 insertions, 34 deletions
diff --git a/hoogle-test/ref/Bug873/test.txt b/hoogle-test/ref/Bug873/test.txt
deleted file mode 100644
index 5e1117a4..00000000
--- a/hoogle-test/ref/Bug873/test.txt
+++ /dev/null
@@ -1,27 +0,0 @@
--- Hoogle documentation, generated by Haddock
--- See Hoogle, http://www.haskell.org/hoogle/
-
-@package test
-@version 0.0.0
-
-module Bug873
-
--- | Application operator. This operator is redundant, since ordinary
--- application <tt>(f x)</tt> means the same as <tt>(f <a>$</a> x)</tt>.
--- However, <a>$</a> has low, right-associative binding precedence, so it
--- sometimes allows parentheses to be omitted; for example:
---
--- <pre>
--- f $ g $ h x = f (g (h x))
--- </pre>
---
--- It is also useful in higher-order situations, such as <tt><a>map</a>
--- (<a>$</a> 0) xs</tt>, or <tt><a>zipWith</a> (<a>$</a>) fs xs</tt>.
---
--- Note that <tt>(<a>$</a>)</tt> is representation-polymorphic in its
--- result type, so that <tt>foo <a>$</a> True</tt> where <tt>foo :: Bool
--- -&gt; Int#</tt> is well-typed.
-($) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b
-infixr 0 $
-($$) :: (a -> b) -> a -> b
-infixr 0 $$
diff --git a/hoogle-test/src/Bug806/Bug806.hs b/hoogle-test/src/Bug806/Bug806.hs
index 6deb98c1..f2a9a099 100644
--- a/hoogle-test/src/Bug806/Bug806.hs
+++ b/hoogle-test/src/Bug806/Bug806.hs
@@ -1,5 +1,4 @@
{-# LANGUAGE Haskell2010 #-}
-{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE UndecidableInstances #-}
module Bug806 where
diff --git a/hoogle-test/src/Bug873/Bug873.hs b/hoogle-test/src/Bug873/Bug873.hs
deleted file mode 100644
index 4df1b772..00000000
--- a/hoogle-test/src/Bug873/Bug873.hs
+++ /dev/null
@@ -1,6 +0,0 @@
-{-# LANGUAGE Haskell2010 #-}
-module Bug873 (($), ($$)) where
-infixr 0 $$
-
-($$) :: (a -> b) -> a -> b
-f $$ x = f x