æʃliŋ, loaf of autismo @aescling@cat.family

the b in clodsire stands fur bifurcated

@wallhackio like this?

​ ​

* cylinder

be careful, it does unthinkable things to your mind and ^{B O D Y}

would you smoke the blender default cylinder JUUL

cc @vaporeon_

mornyawn btw . also @clock, what time is it

no wonder i always liked OCaml

i said this as if OCaml weren’t a LISP in disguise

@vaporeon_ the lad

@vaporeon_ yes, definitely

@vaporeon_ if it's eeveening yet fur ny’all then feel free to take a look at the code if you still want to try to purrocess it

also, mornyawn . @clock, do your thing

@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

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

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

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