haskell

TwitterFacebook
Get flash to fully experience Pearltrees
http://linuxsoftwareblog.com/?p=819 I’ve combined my new found hobby – cycling; my favourite gizmo – my Android phone; and my favourite programming language – Haskell, to implement the project: Gps2HtmlReport. A GPS tracking device. Most Smart Phone markets will have Apps to do the job. I certainly recommend the open source OSMTracker App .

» GPS to HTML Report with Haskell

The actor model provides high-level concurrency abstractions to coordinate simultaneous computations by message passing. Languages implementing the actor model such as Erlang commonly only support single-headed pattern matching over received messages. In

Actors with Multi-Headed Receive Clauses

http://sulzmann.blogspot.com/2008/10/actors-with-multi-headed-receive.html
The current section of the GHC manual on creating DLL's on Windows is fairly confusing to read, and has some bugs (i.e. 3605 ). Since I got tripped up by the current documentation, I offered to rewrite sections 11.6.2 and 11.6.3 (merging them in the process). Creating Windows DLL's with GHC is surprisingly easy, and my revised manual section includes an example which can be called from both Microsoft Word (using VBA) and C++. I've pasted the revised manual section as the rest of this blog post.

Haskell DLL's on Windows

http://neilmitchell.blogspot.com/2009/11/haskell-dlls-on-windows.html
sound

With this toolkit workflows can be speficied using combinators in a very high level declarative monadic style. Workflows consist of typed tasks that produce results that can be passed as parameters to other tasks. Tasks are constructed by combining single steps sequentially or in parallel. http://wiki.clean.cs.ru.nl/ITasks

ITasks - Clean

hledger.org - hledger

hledger is a computer program for easily tracking money, time, or other commodities, inspired by ledger . It is quite limited in features, but lightweight and reliable. For some, it is a bare-bones, simpler, less expensive alternative to Quicken or GnuCash. It is available for free under the GNU General Public License. http://hledger.org/

GF - Grammatical Framework

http://www.grammaticalframework.org/ Don't worry if you don't know most of the references above - but if you do know at least one, it may help you to get a first idea of what GF is. GF was first created in 1998 at Xerox Research Centre Europe , Grenoble, in the project Multilingual Document Authoring. At Xerox, it was used for prototypes including a restaurant phrase book, a database query system, a formalization of an alarm system instructions with translations to 5 languages, and an authoring system for medical drug descriptions. GF has an interactive command interpreter, as well as a batch compiler. Grammars can be compiled to parser and translator code in many different formats.
real world haskell

http://lyah.haskell.fr/ N’hésitez pas à m’envoyer vos remarques quant à la traduction ! (contact at haskell dot fr) Ce travail est une traduction de Learn You a Haskell For Great Good! . Le texte original est de Miran Lipovača, la traduction a été réalisée par Valentin Robert.

Apprendre Haskell vous fera le plus grand bien ! -

This weekend was AusHac 2011 . I spent my time getting Haskell to compile to the Nintendo DS. I remember reading a while ago about someone using JHC to compile a Haskell executable for the iPhone. JHC is a Haskell compiler that outputs fairly sane C code. I figured that it'd be fairly easy to get it to output code to work with devkitPro .

Learn Nintendo DS a Haskell - BAM Weblog

http://brianmckenna.org/blog/learn_nintendo_ds_a_haskell
compiler

blog

Planet Haskell

http://planet.haskell.org/ Miles Gould asked his Twitter followers whether they used git-add -p or git-commit -a and how often. My reply was too long for Twitter, so here it is. First the short version: I use git-add -p frequently, and git-commit -a almost never.
framework

http://www.haskell.org/haskellwiki/99_questions/1_to_10 * Main > isPalindrome [ 1 , 2 , 3 ] False * Main > isPalindrome "madamimadam" True * Main > isPalindrome [ 1 , 2 , 4 , 8 , 16 , 8 , 4 , 2 , 1 ] True * Main > flatten ( Elem 5 ) [ 5 ] * Main > flatten ( List [ Elem 1 , List [ Elem 2 , List [ Elem 3 , Elem 4 ] , Elem 5 ] ] ) [ 1 , 2 , 3 , 4 , 5 ] * Main > flatten ( List [ ] ) [ ] If a list contains repeated elements they should be replaced with a single copy of the element. The order of the elements should not be changed. (**) Pack consecutive duplicates of list elements into sublists.

99 questions/1 to 10 - HaskellWiki

A Haskell bookshelf « programming musings

My favourite scheme implementation is scheme48 , which takes its name from its being initially implemented in 48 hours by Richard Kelsey and Jonathan Rees in August 1986 . They used Common Lisp on a Symbolics 3600 and Maclisp on a PDP-10 . Now, thanks to Jonathan Tang’s tutorial, you can write yourself a scheme in 48 hours , but using Haskell instead of Lisp. The tutorial is intended as an introduction to Haskell for Schemers (and (brave) programmers in general) wanting to get started in the purest member of the functional family.
external

functor

Learn You a Haskell for Great Good! - Chapters

This work is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 Unported License because I couldn't find a license with an even longer name.

Learn Me A Haskell

I'll get to the title topic in just a minute. But first, more about Real World Haskell. C urrently I'm a little more than halfway through the book, and still liking it quite a lot.

Sententia cdsmithus

This is the summary of week 7 of my Haskell class for children, aimed at ages 11 through 13 or so. You can go back and review the previous weeks to catch up. We’ve now spent six weeks learning some of the Haskell programming language, and making various pictures, from simple stuff to some pretty complicated drawings.

Things that amuse me

Recently someone asked me on #haskell if you could use the Haskell LLVM bindings to compile some abstract syntax to a Haskell function. Naturally I said yes, but then I realized I had only done it for a boring language with just one type. I had no doubt that it could be done for more complicated languages with multiple types, but it might not be totally obvious how. So I decided to write a simple compiler, and this blog post is the result. First, a simple example: What has happened is that the string has been parsed to an abstract syntax tree, translated into LLVM code, then to machine code, and finally turned back into a Haskell callable function.
http

parsing

monad