News for hackers. Stuff that matters.
Re:Some Functional Programmers Are Arrogant by pron on Friday July 10, 2015 @12:25PM (#9864912)
> but instead a note that human reasoning can be accurately transcribed in types

Is that human reasoning or logic? :)

> But it is at the core of other more "right" ways because it as a notion is very composable.

It is and it isn't. Where it counts, it's got some composability problems, like with composing monads. Moand transformers are way too high-order for me to follow (or care to learn to follow) -- remember, NASA said first-level and second-level pointer indirection are fine, but not third-level; I think this applies to high-order functions, too. OTOH, "scoped" continuations[1] compose perfectly, while still being statically typed and explicit about which "monad" they're in[2].

> Nice impure models share more similarity with PFP than with standard imperative programming, too.

I totally believe that, but from the programmer's perspective, that is completely irrelevant. That's something we want to stay hidden, left to those doing PL research. Give us the results -- we really hope we don't need to learn how you got there :)

> Then you ignore that "mathy" imperative programming (and "mathy" OO for that matter) exist and are healthy and probably have a lot to share, too.

Considering that 99% of algorithms are expressed imperatively and invented by imperative programmers, I'd say that's likely true. People doing DB, numerical/scientific computation, machine learning, distributed computing and concurrency research work mostly in C, Java and Matlab -- not Haskell or Idris.

> Types should be studied even if it is conclusively proven that humans cannot stand their UX. Why? Because they are as powerful a language for expressing formal thought as humans have yet invented. We'll figure out the UX someday, but if we step away from the seat of utility then we'll have lost something vital.

I totally agree!

[1]: Scoped continuations are nested continuations that allow functions to pause at each level of the scope (think how nested try-catch blocks work with different exception types) -- I'll post my talk when it's available online.

[2]: Think Java's checked exceptions.

Re:Some Functional Programmers Are Arrogant by tel on Friday July 10, 2015 @02:10PM (#9865666)
I don't see any meaningful distinction between human reasoning and logic, tbqh.

As I stated earlier, your stacks of scoped continuations are exactly equivalent to monads but, depending on how you restrict them, a little less flexible. I don't mean this to say something trivial—I mean it to say that every composition problem solved in each place is identically solved in the other.

I'm confident that your 99% claim holds historically to various degrees, but not completely. Plenty of mathematical algorithms were (a) constructive and (b) first formulated declaratively. We have spent the last 30-50 years describing many more algorithms at a much more furious pace at a time where publicity depended deeply upon using an imperative language... so historical explanations have that going for them.

Re:Some Functional Programmers Are Arrogant by pron on Friday July 10, 2015 @03:24PM (#9866195)
> As I stated earlier, your stacks of scoped continuations are exactly equivalent to monads but, depending on how you restrict them, a little less flexible.

But they compose better, not requiring monad transformers while still being type-safe. For the continuation to decide on which scope to pause on is like a monadic function returning a monadic value of a monad not directly enclosing it, but one or more levels up.

Re:Some Functional Programmers Are Arrogant by tel on Saturday July 11, 2015 @08:28PM (#9872091)
You can compose Monads in this way too. Even in Haskell, mtl-style transformers are very similar.
Re:Some Functional Programmers Are Arrogant by tome on Sunday July 12, 2015 @02:33AM (#9872758)
I would very much like to hear more about this.