Here's a community effort to collaboratively put together a comparison of Haskell web frameworks for building RESTful web services. It's not yet the most in-depth of overviews, but I'm sharing it early hoping that people experienced with these frameworks could share their knowledge and help make a great resource.
Esther Schindler writes: Yale is reporting that Paul Hudak, professor of computer science and master of Saybrook College, died last night after a long battle with leukemia. He was known as one of the principal designers of Haskell, which you probably don't need to be told he defined as "a purely fun...
May be a bit offtopic, but someone might find it useful... So. Here is sfl, the Simple Functional Library for C++, inspired by Haskell, aiming to make functional programming in c++ more effective and fun. Already used in production, compatible with clang, gcc, and VS2013.
I'm pleased to announce the first release of Haskell bindings  to the FLTK GUI  toolkit.
It now works smoothly on Windows (64-bit), Linux and Mac allowing you to create truly cross-platform native GUI applications in pure Haskell and deploy statically linked executables with no dependencies.
Most of the FLTK API is covered except for a few minor widgets which I plan to get to in the next release.
Motivation behind the package and installation instructions are found in the Haddocks . And to get you started it ships with a number of demos.
If you have any issues please report them on the Github  page.
I'd also love any other feedback so feel free to comment here or email me at the address listed on the Hackage  page.
Hi guys , I converted a reactive banana tutorial I read from Reactive Banana to Elerea and I works exactly how the example does now. Here is the code hopefully it will help others get started too , it was quite a large learning and kinda still is. http://pastebin.com/kTnBBmLp
Could somebody check my code I think I have been a bit hacky with the usage of transfer to create a signal? Any improvements would be great too. I timed the program and it too 0.001s. Its not really a valid performance test though lol but from what I can see 5 signals is nothing.
Why we need metaprogramming like template Haskell and eval in lisp ? does that mean our code is still not elaborate enough , or the programming languages still lacks sth? which recalls me the relationship between recursion and combinatorics.
Bookmarking this article about the Haskell programming language.
By declaring an isomorphism data type and instantiating it into the Category type class, this provides a framework for writing invertable code. One example of inverse functions are a parsers and pretty printers. If you are writing a parser and pretty printer, it is best to declare your parsers and pretty printers together. You can do this by writing both into an isomorphism data type.
Write your primitive combinators all as isomorphisms, then you can declare your parser and pretty printer in a single function. Now you can define your own programming language using a single data type, and you get just extract the parser and pretty printer from this data type. When you want to parse, evaluate the isomorphism in the "forward" direction. If you want to pretty print, evaluate your isomorphism in the "reverse" direction.
If your parser and pretty printer is monadic (which most parsers and pretty printers are), then just define your isomorphism such that the forward and reverse functions are Kleisli categories.
meaningless ramblings. Writing invertible functions. Last couple of posts in this blog might've been at least potentially useful. It probably wouldn't be the case for this one, because it's still about parsing, but doesn't use Parsec. Let's say you're writing a simplifier of arithmetic ...
Bindings for the (now open source!) Z3 4.x Theorem Prover (https://github.com/Z3Prover/z3). Z3.Base.C provides the raw foreign imports from Z3's C API. Z3.Base does the marshaling of values between Haskell and C, and transparently handles reference counting of Z3 objects for you.