« earlier | later » Page 3 of 4
All About Monads edit / delete
Handy introduction and reference to Haskell's standard monads.
to functional haskell monads research ... on 19 October 2006
The Continuation monad edit / delete
Implementing call/cc using monads. The same approach could be used to implement occam-style concurrency in Haskell without needing to mess with the runtime -- I reckon there's a paper in there...
to concurrency functional haskell monads research ... on 01 October 2006
Scrap your boilerplate ... in Haskell edit / delete
Generic programming in GHC -- with one of the examples being traversing ASTs in a nice way. This looks distinctly useful (and rather nicer than the current approach I'm using!), provided it meshes nicely with the monad stuff [yes, it does, it's in the fir
to compiler functional haskell research ... on 01 October 2006
Haskell - Wikibooks, collection of open-content textbooks edit / delete
Quite a good Haskell tutorial.
to functional haskell programming research ... on 06 September 2006
Of monads and spacesuits edit / delete
How monads work in Haskell, via a rather silly metaphor.
to functional haskell monads research ... on 15 August 2006
Functional Programming HOWTO edit / delete
A guide to some of Python's functional features.
to functional programming python ... on 05 July 2006
Factor programming language edit / delete
A FORTH-style language with Lisp data types. Interesting, although I'm not convinced I'd actually want to program in it.
to design factor forth functional language lisp research ... on 20 May 2006
An Oxford course for beginners to the lambda calculus.
to functional lambda-calculus research theory ... on 20 March 2006
SAC-Home [Welcome] edit / delete
Single Assignment C, a "functional" (they claim, but no higher-order functions!) programming language for compute-intensive applications.
to functional parallel programming research ... on 27 October 2005
Google Scholar: functional pearl edit / delete
Interesting papers about tricks in functional programming.
to functional programming ... on 10 March 2005
« earlier | later » Page 3 of 4
| - functional | |
| 1 | + 1ml |
| 1 | + apue |
| 1 | + bcpl |
| 1 | + c |
| 1 | + c++ |
| 3 | + cmp409 |
| 3 | + compiler |
| 2 | + concurrency |
| 1 | + coq |
| 1 | + correctness |
| 1 | + design |
| 1 | + emas |
| 1 | + eratosthenes |
| 1 | + etext |
| 1 | + factor |
| 1 | + formal-verification |
| 1 | + forth |
| 1 | + futures |
| 14 | + haskell |
| 1 | + kent |
| 1 | + krc |
| 1 | + lambda-calculus |
| 1 | + language |
| 11 | + language-design |
| 1 | + lisp |
| 1 | + maths |
| 5 | + ml |
| 1 | + module |
| 1 | + modules |
| 4 | + monads |
| 1 | + mythryl |
| 4 | + ocaml |
| 1 | + parallel |
| 1 | + primes |
| 13 | + programming |
| 1 | + python |
| 1 | + reading-code |
| 12 | + research |
| 1 | + retrocomputing |
| 1 | + setl |
| 1 | + sieve |
| 1 | + standard-ml |
| 3 | + teaching |
| 1 | + theory |
| 1 | + turner |
| 1 | + type-checking |
| 1 | + type-inference |
| 1 | + type-systems |
| 1 | + types |
| 1 | + unix |
tasty by Adam Sampson.