Lizardsquid, maker of noises @lizardsquid@computerfairi.es

@BatElite @lucidiot@tiny.tilde.website oh my gosh I'm giggling

@BatElite @lucidiot@tiny.tilde.website ;;)

@lucidiot@tiny.tilde.website @BatElite this is just lambda calculus, which you don't need to know.

In haskell, the way to express the same thing is a little more simple:

(λf x → f x)

(or without special unicode: (\f x -> f x) )

@lucidiot@tiny.tilde.website @BatElite that isn't correct

(λf . (λx . (f x))

is an expression that basically means "if I'm given a function, called f, and a value, called x, then I will apply that function to the value"

so if I wrote (λf . (λx . (f x)) (addFive) (3), the expression means "run addFive on 3", so we'll get a result of 8

(of course this is a completely useless transformation, I could just directly write "addFive 3")

@g I've found that a bit difficult in idris too...

@fennel sleep well, dear deer

@Lex_Lee D::

@tindall@cybre.space oh dear, I'm sorry you had such a long day

*offers gentle hugs*

@fennel O::

@mallaidh !