News for hackers. Stuff that matters.
Re:Learning Haskell is no harder than learning any other pro... by ukj on Sunday October 06, 2019 @09:35AM (#21171917)
>what makes it functional is that the state / memory must be explicitly acknowledged

Isn't state/memory assumed by default when talking about computation?

What kind of computations you can perform on a Turing machine without a ticker tape?

Re:Learning Haskell is no harder than learning any other pro... by kchamplewski on Sunday October 06, 2019 @09:37AM (#21171926)
Lambda calculus, for example, has no ticker tape.
Re:Learning Haskell is no harder than learning any other pro... by ukj on Sunday October 06, 2019 @09:43AM (#21171958)
What kind of computations can you perform with Lambda calculus without any input variables?

What are you applying your α-conversion and β-reduction operations to?