the thing about following the types and using the compiler to find the types of your holes is that, while it will create code that compiles and apparently passes the tests, it will also create code that is inscrutable to YOU

filtering ::
  (Applicative k) =>
  (a -> k Bool) ->
  List a ->
  k (List a)
filtering p = foldRight g $ pure Nil
  where
    -- what the fuck even is this
    g a as = f a <$> p a <*> as

    f :: a -> Bool -> List a -> List a
    f _ False as = as
    f a True as = a :. as

structural recursion my beloved. still don't understand this though

@aescling If you don't mind an extremely stupid question from someone who has forgotten all the Haskell that they ever learned: What does => do? I remember -> basically specifying the list of arguments, but I don't remember what => did

@vaporeon_ this is hard to expurress succinctly.

(C t) => ... means that in the type expurression ..., the type t is known to be a member of the typeclass C

an example of a typeclass is Eq, fur types that have total equality checks:

class Eq a where
  (==) :: a -> a -> Bool
  (/=) :: a -> a -> Bool

so, fur example, the following (extremely trivial) function, we contrain the polymorphism of f to parameterize only on types which are known instances of Eq, making it legal to polymorphically invoke the equality check on the generic parameter a:

f :: Eq t => t -> Bool
f a = a == a

@aescling Oh! Now that you remind me, I do remember learning about typeclasses! Thank you!

@aescling I'm not awake enough to process this, remind me this evening

@vaporeon_ i WROTE this code and i am struggling to purrocess it