News for hackers. Stuff that matters.
Re:Why functional programming? Why Haskell? by davidw on Saturday August 10, 2013 @02:01AM (#6190222)
> Since pure code has no dealings with the outside world, and the data it works with is never modified, the kinds of nasty surprise in which one piece of code invisibly corrupts data used by another are very rare.

If you're trying to sell me on Haskell, right there you just made me think "uh, ok, guys, but my code does not live in an ivory tower, and very much needs to deal with the real world, messy data, users, and so on".

I realize that Haskell can handle that, too, but in terms of copy writing, it leaves something to be desired.

They subsequently go on to write much more interesting reasons why you might consider Haskell, including examples of companies using it in the real world, but they should not lead with talk of 'purity'.

Re:Why functional programming? Why Haskell? by rtfeldman on Saturday August 10, 2013 @07:49AM (#6190749)
> in terms of copy writing, it leaves something to be desired.

Haskell advocacy is high in the running for the least effective in the business. Boosters can't seem to help but pitch the things they care about rather than the things the listener does. Maybe it feels satisfying, but it's no way to attract converts.

A more effective approach would be to choose common tasks people perform in other languages and demonstrate how they can be less (error-prone, time-consuming, verbose) in Haskell.

For instance, I recall reading about a Haskell Web framework where the compiler guarantees user-generated content never makes it into any served HTML unsanitized. What a boon for security! However, this is not shouted from the rooftops; instead, it's taking me so long to track down I've given up in the hopes that someone will post it here instead.

Re:Why functional programming? Why Haskell? by tazjin on Saturday August 10, 2013 @08:18AM (#6190834)
You are searching for Yesod - http://www.yesodweb.com - which has some other fancy features like making sure that you can never render an incorrect dynamic URL (because URL's are represented by data types) and more such features.

I've used Yesod in actual real-world projects and it was always a pleasure, albeit sometimes slightly complicated - the new version (which I haven't used yet) promises to simplify this a lot though.

Re:Why functional programming? Why Haskell? by rtfeldman on Saturday August 10, 2013 @11:22AM (#6191364)
Thanks!
Re:Why functional programming? Why Haskell? by mbrock on Saturday August 10, 2013 @03:02AM (#6190305)
I think it's important to emphasize that while Haskell provides purity, it also enables the definition of impure code in a clear and distinct way, the idea being to encourage a clean "separation of concerns" between logic and interaction.

It's not really that Haskell removes impurity, more that it adds purity. The "main" function of any Haskell application is an IO action, but you can define pure functions which relinquish IO and global state. And the best practices include doing that as much as possible, which is a terrific way of making your program more comprehensible and correct.

Re:Why functional programming? Why Haskell? by _delirium on Saturday August 10, 2013 @07:17AM (#6190696)
I wonder if it would be possible to develop an idiom for programming in a language like C that separated those concerns. Put most/all application logic into const/pure functions, and then have a separate set of interaction functions, i.e. just pull out that one bit of Haskell philosophy from the rest of the language design.

Speculative guesses as to what might stand in the way:

1. The lack of a purity-tracking mechanism like Haskell's may make programming in this style in C more complex and error-prone.

2. The fact that C compilers don't expect you to use this programming style may mean they don't optimize common operations in the way Haskell does; for example, if you do manipulations on large arrays in a functional rather than imperative style, Haskell will optimize away a lot of the temporary arrays, but C compilers may not.

Re:Why functional programming? Why Haskell? by guerrilla on Saturday August 10, 2013 @10:40AM (#6191215)
I am currently trying to get some of this working in a library I call 'libalgae' in which I'm encoding algebraic data types and their eliminators (similar to how Epigram works, like an induction principle for each datatype: This allows us to rule out non-terminating programs and ensure coverage of all constructors.) I'm not very much concerned with optimization, as I'd like to use this "DSL" as a bootstrapping language for a self-hosting programming language which provides the same in a more natural way.

The way I've done it so far is seems to be working, and I've implemented standard types (their introduction and elimination rules) and few functions on them. The two main problems I've run into is memory leaking and portability.

Since the constructors of an algebraic data type should return const data, it's a bit difficult to free them without violating the type system. I haven't decided yet if I'll end up violating the type system or just drop that const. I think the latter makes more sense, since we're trusting C as little as possible in the first palce. Everything actually might as well be done in void pointers but I think there's some value in using types where possible for documentation's sake.

About portability. The main thing here that I ran into was that there's no real standard and portable way of doing closures or anonymous functions in C yet. Right now, what I'm doing is using nested functions, which works in GCC and clang, but I have no idea if they'd work in MSVC or any of the other compilers out there like pcc and lcc. OS X has blocks, but I figure if they're using gcc too, why not stick with nested functions. As far as I can tell, I won't have the problem of having nested functions returning before their parent does because of the eliminator model.

The libCello (http://libcello.org/) author has been able to successfully model typeclasses in C, so I will be picking that up as soon as I get around to it.

I pushed some of the code to GitHub just now for this post: https://github.com/guerrilla/libalgae

I'm glad to hear other people had the same idea. If anyone has any suggestions, please let me know, as I wouldn't mind some collaboration on this.

Re:Why functional programming? Why Haskell? by mbrock on Saturday August 10, 2013 @01:52PM (#6191971)
Since beginning to see the value of purity, I write imperative code in a different way. I don't care much about local manipulation of state for algorithms and such, but I write a lot more pure functions.

It's not only that purity is safe and beautiful. It's also in many cases much easier to understand, because it's about writing functions that express transformations. These transformations should make sense in a conceptual way.

When you distill your domain concepts (see "Domain-Driven Design") and write pure functions on domain data, the result is remarkably clear, testable, and debuggable, no matter which language.

Previously I would have been (prematurely) concerned with the efficiency of in-place updates, but since I'm not writing high-performance CPU-bound software, I don't care about that anymore until the profiler tells me to.

Re:Why functional programming? Why Haskell? by vladimirralev on Saturday August 10, 2013 @09:50PM (#6193459)
What is your imperative language? Do you write imperative code in OOP? Do you find yourself compelled to implement everything with static methods?
Re:Why functional programming? Why Haskell? by mbrock on Sunday August 11, 2013 @01:43AM (#6194000)
I currently work with Java. This codebase employs a kind of pseudo-OOP, according to a pattern that I think is at least somewhat popular. Data is mostly represented by objects with only getters and setters. Business logic is contained in "services," which are basically stateless singletons (handled by dependency injection).

The best code in the system, IMO, consists of small stateless singletons with clear dependencies and non-modifying operations. This code often comes out of test-driven development and has tests that read like specifications.

Re:Why functional programming? Why Haskell? by _pmf_ on Saturday August 10, 2013 @08:17AM (#6190828)
GCC's pure and const function attributes pretty much allow for these optimizations.
Re:Why functional programming? Why Haskell? by _delirium on Saturday August 10, 2013 @09:14AM (#6190985)
For scalar types I agree, but now that I think of it, I'm not sure it's even possible to write array code using them, unless I'm missing something. If you can't modify the array in-place or write to a provided "output" parameter, and you can't malloc a fresh array to return (because that's a side effect), how do you write a pure function of type int[] -> int[] at all?

The nice thing about Haskell is that it conceptually mallocs a fresh array to return, but then optimizes away the intermediate array in a lot of cases.

Re:Why functional programming? Why Haskell? by cpeterso on Saturday August 10, 2013 @03:21PM (#6192303)
I believe GCC's pure and const function attributes, like the restrict keyword, are only advisory and have no extra compile-time checks that your functions are actually pure or const.
Re:Why functional programming? Why Haskell? by tome on Saturday August 10, 2013 @07:19AM (#6190701)
Absolutely it would, but it's much easier with a type system to guide you.
Re:Why functional programming? Why Haskell? by wunki on Saturday August 10, 2013 @03:04AM (#6190312)
The power of Haskell is that it acknowledges the fact that it's a messy world and deals with it with the help of Monads.

You could turn it around and say that non-haskell programs live in an ivory tower and ignore the messy world below :)

Re:Why functional programming? Why Haskell? by aristidb on Saturday August 10, 2013 @05:43AM (#6190551)
I downvoted you because you're putting Monads on a pedestal and misrepresenting their purpose. When you mean IO (or perhaps ST and State) please don't say "Monads". Remember that [] is an instance of Monad too, and it has nothing at all to do with dealing with the messy world. A monad is just a typeclass with two operators that behave according to certain identity and associativity laws, and a _lot_ of types fulfil them.
Re:Why functional programming? Why Haskell? by davidw on Saturday August 10, 2013 @03:23AM (#6190338)
> it's a messy world and deals with it with the help of Monads.

So someone has a tough problem dealing with the messy real world, and then you tell him to use Monads. Now he has two problems :-)

Ok, I'm kidding, but mbrock's answer is a lot better in terms of selling the language in that it mentions something that anyone can figure out is a good idea, without getting into the details of it.

> encourage a clean "separation of concerns" between logic and interaction.

Re:Why functional programming? Why Haskell? by dfeltey on Saturday August 10, 2013 @02:44AM (#6190278)
I do understand your point, but purity is one of the defining characteristics of Haskell, and one of the features that differentiates it from most other languages, so I think it should be mentioned up front when introducing Haskell.
Re:Why functional programming? Why Haskell? by davidw on Saturday August 10, 2013 @02:51AM (#6190290)
Mention it, maybe, but pointing out how great it is not to have to deal with that messy "real world" is bad marketing. It makes you think "oh, so all these benefits only exist in the magical fairy land and not in the real world where I work?"
Re:Why functional programming? Why Haskell? by mercurial on Saturday August 10, 2013 @03:07AM (#6190318)
I understand what you're saying. It would be better to just talk about the enforced separation between pure code and code with side-effects, and explain that it's possible to structure a normal program so that it's mostly pure.
Re:Why functional programming? Why Haskell? by seanmcdirmid on Saturday August 10, 2013 @06:16AM (#6190597)
You are just making a claim though, no one know if it is actually true. Semantic purity doesn't necessarily lead to human clarity, which is one of the mountains Haskell has had to climb: it doesn't seem "easier" or "more simple" than other approaches, only claims of safety might hold up to some scrutiny.
Re:Why functional programming? Why Haskell? by mercurial on Saturday August 10, 2013 @11:01AM (#6191290)
You will note that I make no claims about clarity, only that it is possible to separate pure from impure code in Haskell (which is certainly true).

The problem with Haskell and clarity are, in my experience, twofold:

- large amount of high-level concepts to absorb (though not everything is necessary to start producing code)

- the power of the language is its own worst enemy at times - it is possible to write a pipeline of complex computation with very little work, which leads to less code but less readability (on the other hand, Haskell functions are typically short, which helps a lot with maintaining up-to-date comments)

On the other hand, the separation between pure and impure code is not a complex notion per se, and reasoning about pure code is made much easier.

Re:Why functional programming? Why Haskell? by seanmcdirmid on Saturday August 10, 2013 @07:53PM (#6193129)
Right. It is quite easy to build convoluted Haskell code just as it is easy to to build convoluted Java code.

One of my primary complaints about Haskell, however, is that Haskell code is impossible to debug. You can reason about it, the type checkers can check deep properties about it, but it is difficult to actually observe the computer executing it! To me, this is a deal breaker.

Re:Why functional programming? Why Haskell? by tome on Sunday August 11, 2013 @03:53AM (#6194254)
> Right. It is quite easy to build convoluted Haskell code just as it is easy to to build convoluted Java code.

I don't think it's quite as easy, but I'll concede the point so I can make the more important point: it is much easier to write clear Haskell code than clear Java code (at least, "clear" as I understand clarity, YMMV).

> You can reason about it, the type checkers can check deep properties about it, but it is difficult to actually observe the computer executing it!

Certainly purity makes it hard to observe, and laziness makes it hard to understand how the program executes. However purity also means that static debugging (e.g. QuickCheck) is far more powerful than in other languages so dynamic debugging (actually watching your running program) is less needed. In fact I do far less debugging in Haskell than in Python, say. I first fight the compiler. When I win, the end result is correct more often in Haskell than in any other language I've ever used.

> To me, this is a deal breaker.

That's fair enough. Everyone has their own preferences. Personally I've never noticed it be a problem.

Disclaimer: I don't write performance sensitive code. I expect performance tuning in Haskell is harder than what I've described above.

Re:Why functional programming? Why Haskell? by seanmcdirmid on Sunday August 11, 2013 @07:31AM (#6194715)
> I first fight the compiler. When I win, the end result is correct more often in Haskell than in any other language I've ever used.

And now we get to a few of questions related to bias:

* Given that debugging is difficult in Haskell, do Haskell programmers to get in the habit of statically debugging their code? Is that really more "better" than dynamic debugging? Some type error messages in languages like Scala and Haskell can make static debugging quite painful.

* Does Haskell's powerful type system bias it to well understood problems with meaningful types? I attended a WGFP meeting once, and it was amazing to hear people like SPJ talk about how they found elegant solutions to icky programming problems, but I thought that, given a dirtier language, you could just write a dirty solution and be done with it.

* Would Python's dynamic type system make it more suited to problems with dirtier less clear types when compared to Haskell? If you know both Haskell and Python, do you divide your potential programs into "Python programs" and "Haskell programs"?

* When one writes Haskell code, do they really not have to debug and test their code?

Re:Why functional programming? Why Haskell? by mercurial on Sunday August 11, 2013 @12:27PM (#6195301)
> * Given that debugging is difficult in Haskell, do Haskell programmers to get in the habit of statically debugging their code? Is that really more "better" than dynamic debugging? Some type error messages in languages like Scala and Haskell can make static debugging quite painful.

I'm not sure what you mean by "static debugging". You're going to get type error messages while you're trying to compile, but certainly not at runtime. GHC really does its best to make them as explicit as possible and often suggests the correct fix.

> * Does Haskell's powerful type system bias it to well understood problems with meaningful types? I attended a WGFP meeting once, and it was amazing to hear people like SPJ talk about how they found elegant solutions to icky programming problems, but I thought that, given a dirtier language, you could just write a dirty solution and be done with it.

Not really. It is really a general purpose language, and you find very good libraries to interact with less strongly typed systems (eg, JSON).

> * Would Python's dynamic type system make it more suited to problems with dirtier less clear types when compared to Haskell? If you know both Haskell and Python, do you divide your potential programs into "Python programs" and "Haskell programs"?

If anything it would be more a question of libraries. One thing you won't be able to get in Haskell though is something like an ORM, with lazy-loaded collections and stuff like that. I find myself missing SQLAlchemy. Persistent does not have the same flexibility, despite Esqueleto which looks nice.

> * When one writes Haskell code, do they really not have to debug and test their code?

No. The best type system does not help when you write the wrong values with the right type in your program, or get the logic of your program wrong. But the errors tend to be more interesting. Also, you have a very powerful system to test the pure parts of your code (QuickCheck).

Re:Why functional programming? Why Haskell? by tome on Sunday August 11, 2013 @08:19AM (#6194799)
I don't have good answers to your first two questions, since they're very open ended. I can give you my personal experience regarding the second two.

* Would Python's dynamic type system make it more suited to problems with dirtier less clear types when compared to Haskell? If you know both Haskell and Python, do you divide your potential programs into "Python programs" and "Haskell programs"?

No, I classify my potential programs into "Haskell programs". I haven't missed Python once.

* When one writes Haskell code, do they really not have to debug and test their code?

Haskell programmers still have to debug and test, but I find it somewhat easier than I've found it in other languages.

Re:Why functional programming? Why Haskell? by Peaker on Monday August 12, 2013 @07:29PM (#6202943)
You're overstating it. Debugging Haskell code is definitely harder than in other languages.

But it's far from impossible (I use Debug.Trace successfully), and you do it far less often.

So debugging takes 5 times more effort but needs to be done 15 times less than in other languages.

At least that's the deal I'm getting and I don't usually find myself debugging much so it's not a grave concern.

I'd say lack of non nullability or pattern matching are worse show stoppers.

Re:Why functional programming? Why Haskell? by gizmo686 on Saturday August 10, 2013 @09:03PM (#6193306)
Have you looked into Debug.trace? The type of trace is "String -> a -> a". This is a 'pure' function that 'ignores' the first argument and returns the second unmodified. What actually happens is that the first argument is a String that gets printed to stdout. Furthermore, once you give it the first argument, it is simply the identity function, which allows you to easily place it anywhere in you code.

For example, if you have a function: add x y = x+y, and you wanted to see all of the inputs add gets, you could do: add x y = trace (show (x,y)) $ x+y.

For anyone confused about how such a function is possible in Haskell, not that it is in Debug, and the documentation clearly states that it should only be used for debugging.

EDIT: You could also do traceShow (x,y) $ x+y.

Re:Why functional programming? Why Haskell? by seanmcdirmid on Saturday August 10, 2013 @09:42PM (#6193432)
I've seen this, it basically allows us to generate execution trace trees, which is quite trivial in most languages must somehow hard in Haskell.

I've studied a lot of mechanisms for debugging Haskell code, and some of the debugging mechanisms taken for granted in other languages can be clawed back. But at the end of the day, it is a struggle: the purity (or more accurately, laziness) that is supposed to help so much ends up hurting in at least one aspect.

Perhaps why Haskell programs are so easy to reason about statically is because they are so hard to reason about dynamically :)

Re:Why functional programming? Why Haskell? by Peaker on Monday August 12, 2013 @07:34PM (#6202962)
Your last point is the other way around:

Haskell has excellent static reasoning/debugging facilities therefore there is little pressure to make good debugging tools.

I believe purity should make debugging easier, not harder. Laziness should only make performance debugging harder, not correctness debugging.

There is much room for improvement in this space.

Re:Why functional programming? Why Haskell? by tome on Saturday August 10, 2013 @07:12AM (#6190679)
As a day-to-day Haskell programmer I'm happy to say that purity makes it easier to understand the programs that I write. Still, you're welcome to suggest that's an entirely subjective anecdote if you like.
Re:Why functional programming? Why Haskell? by seanmcdirmid on Saturday August 10, 2013 @08:20AM (#6190840)
You'd think that an empirical experiment with new programmers could prove the point, or at least provide conclusive evidence.
Re:Why functional programming? Why Haskell? by tome on Saturday August 10, 2013 @08:28AM (#6190857)
Personally I wouldn't think that. I think that such things are far too complicated to be amenable to scientific study.
Re:Why functional programming? Why Haskell? by seanmcdirmid on Saturday August 10, 2013 @09:33AM (#6191030)
I would normally agree, but specific usability claims are being made continuously about the benefits of purity, while many programmers think of Haskell has being anything but.
Re:Why functional programming? Why Haskell? by tome on Saturday August 10, 2013 @07:07AM (#6190674)
It doesn't say you don't have to deal with 'that messy "real world"'! It is called Real World Haskell after all.
Re:Why functional programming? Why Haskell? by seanmcdirmid on Saturday August 10, 2013 @06:07AM (#6190578)
I think it is great "truth in marketing", because going beyond purity requires talking about things like monads, and then they've lost most of their audience anyways.

It is better to lose those not interested in purity early rather than have those uninterested folks become disappointed later.