A multi-threaded functional programming language with dynamic symbol bindings which provides a state of art runtime engine for 32- and 64-bit platform and a rich set of platform independent libraries, compatible with C++ runtime operations, automatic protection engine for shared objects. Successor of Aleph.

Originally an extension to Axiom, now a separate product. Binaries are available free for non-profit use, with documentation, tips, projects and links.

Functional language developed mainly for Genetic Programming experiments. Inspired by ideas of other small, esoteric languages (Unlambda, Lazy K, Joy, Iota, Zot, ...), and pure functional Haskell.

BitC is a systems programming language that combines the low level nature of C with the semantic rigor of Scheme or ML.

An XML centric programming language with higher order, semantic subtyping, pattern matching and overloading, and open source implementation.

Functional stack-based language inspired by Joy; main differences: Cat has static typing with type inferencing (like ML, Haskell), and term rewriting macro language extension language, MetaCat. Open-source, public domain.

A Haskell-like language with a powerful type system based on dependent types.

Functional, categorical language, by University of Calgary, Canada. Innovative organization: based on theory of strong categorical datatypes divided into 2 subclasses: inductive (built up by constructors in the familiar way), and coinductive (broken down by destructors).

Parallel functional language to program reactive systems and parallel algorithms using distributed memory. Extends Haskell, but overrules lazy evaluation whenever needed to support parallelism; gives enough control to implement parallel algorithms efficiently, no need for low level details of process management.

Offers documentation as a frequently asked questions list. Also provides links to general topic, technical and other resources.

A novel functional language that claims to be faster than C in some cases.

Claus Reinke's , well organized bookmarks on FP.

Includes a brief review of REBOL from a functional programming perspective.

A small functional programming language, with polymorphic typing, algebraic types, pattern matching and higher-order functions.

The 2002 International Conference on Functional Programming covers the entire spectrum of functional programming, from practice to theory, and from established functional programming languages (Scheme, ML, Haskell) to novel language designs and to the functional aspects of object-oriented or concurrent languages. October 4-6, 2002 Pittsburgh, PA, USA.

Pure functional language based on function composition rather than application; concatenative language, very like Forth, inputs and outputs stacks, but with higher-level data types and sound mathematical foundation. [Open Source, BSD]

Functional language with inductive and coinductive types. Based on simply-typed lambda calculus augmented with sums, products, and mu and nu constructors for least (inductive) and greatest (coinductive) solutions to recursive type equations.

Functional language to solve impedance mismatch problem by using one language for all 3 tiers of web programming: front-end browser, middle-tier server, back-end database; people, mail lists, papers, talks, wiki, downloads.

A simple functional scripting language for Internet applications.

Parallel functional language developed at Carnegie Mellon, SCandAL project. Most important new ideas: nested data parallelism, language based performance model.

Researches programming environment where advanced language concepts and formal development methods are used to make production-quality software. Strongly typed, higher-order, strict, pure FL; so can be classed with ML, Haskell, and other modern FLs. But also has unique algebraic flavor in the tradition of languages such as CIP-L, and Obj.

Resource-bounded functional language that uses a form of remote procedure call to realize active networking. Part of the SwitchWare Project. Descriptions, documents, downloads, contacts, links.

An extensible functional programming language based on the term rewriting calculus.

A variety of research resources on functional programming languages, implementation, and applications of functional programming languages.

Member of Eden team. Articles.

Java extension with functional features: generics (parametric polymorphism), function pointers (first-class (higher-order) functions), class cases and pattern matching (algebraic (data)types).

Brief article, explains what they are, and how and why their popularity is growing; with links and reader comments. Linux Journal.

Minimalistic functional language based on the Lambda calculus but lacking the Lambda operator. Tutorial, reference, GPLed interpreters available.

John Hughes' list of FP-related tutorials and courses.

Information on monads and functional programming

Basic introduction to monads, monadic programming, and I/O.

John Hughes paper, dates from 1984, circulated as a Chalmers memo.

Encyclopdia article including a definition, comparison, history, and examples.