Functional programming is elite way of programming what resources would you recommend to understand this programming idiom, to understand how to reduce the stateful nature of code.
Everything is a function.All data is immutable.Congratulations, you have mastered functional programming. Now go and overflow the stack.
>>71355304Math, motherfucker, have you studied it?Functional programming is the principles of mathematical proofs applied to (generalized for) arbitrary computations.Haskell is an actual implementation of pure applied logic. It has literally nothing but strongly typed lambda expressions an a set of reduction rules under the hood.
>>71355304Stop wasting your time on this crap and just go back to programming
>>71355304>Functional programming is elite way of programmingsaid no paid programmer, ever
>>71355366I have studies monads. They dont tell me conceptualize computer code where my intuition seem to require state to perform on these objects.
>>71355387Why waste my time programming when down the line I will have to wrestle with monster of complexity, and will be debuging side effects into eternity
>>71355304How can you say FP is the 'elite way' when you don't even know it?Anyway, just pirate the http://haskellbook.com/ and see if it clicks.
>>71355304Proof base course,Type theory, linear algebra and algebra.Proofs and Fundamentals: A First Course in Abstract Mathematics Ethan D. BlochFirst three bookshttps://github.com/jozefg/learn-ttcategory theory steve awodeyLineal algebra linear algebra hoffman and kunzeAlgebraAlgebra Michael artin.
>>71355523Functional programmers don't have to debug/maintain code because they don't write any. Instead, they rather spend their time on online discussion boards talking about how great functional programming is.
>>71355510youre doing it wrong!
>>71356149GHC has been written in itselfkys
>>71356392look at the sources lol
>>71355304Read Algebra of programing.
>>71355304Learn prolog instead/thread
>>71355313>everything is a functionwut
>>71355313>Now go and overflow the stack.but nearly all FP langs have tail recursion
Simple haskell code:data T a = C (T a -> a)foo :: T a -> afoo (C f) = f (C f)bar :: abar = foo (C foo)
data T a = C (T a -> a)foo :: T a -> afoo (C f) = f (C f)bar :: abar = foo (C foo)
>>71357617Thank you based Anon
>>71358209Lambda calculus, motherfucker, do you speak it?