Alice ML is a functional programming language that enriches the statically typed, closed functional world of ML with extensive support for type-safe programming of concurrent, distributed, and open systems. It also features cutting-edge constraint programming technology in the tradition of Oz/ Mozart. Alice ML is a mostly conservative extension of Standard ML.
GeneWeb is a system for people who want to publish their genealogy data on the Web. It can also be used locally (not connected on the net) as a normal genealogy program. It uses very efficient techniques of relationship and consanguinity computing, speaks several languages, and can run in conjunction with an existing Web server (CGI) or standalone using its own internal server.
Isabelle is a popular generic theorem prover developed at Cambridge University and TU Munich. Existing logics like Isabelle/HOL provide a theorem proving environment ready to use for sizable applications. Isabelle may also serve as framework for rapid prototyping of deductive systems. It comes with a large library including Isabelle/HOL (classical higher-order logic), Isabelle/HOLCF (Scott's Logic for Computable Functions with HOL), Isabelle/FOL (classical and intuitionistic first-order logic), and Isabelle/ZF (Zermelo-Fraenkel set theory on top of FOL).
MLton is a whole-program optimizing Standard ML compiler. It generates standalone executables with excellent runtime performance, supports the full SML 97 language, and has a complete basis library. It also has a fast C FFI, source-level time and allocation profiling, and many useful libraries.
sml/nj (Standard ML of New Jersey) consists of a compiler, compilation manager, and libraries for Standard ML. Included are CML (Concurrent ML) and eXene (a toolkit for X based on CML). The compiler produces efficient code for most popular architectures (Intel x86, Sparc, Alpha, Mips, HP-PA, PowerPC) and runs under Unix, Linux, or Windows (95,98,NT).
Bibgrep indexes and efficiently searches BibTex files. Its usage is similar to the command grep and the queries use a Google-like syntax. Bibgrep will create an index for each BibTex file it touches, and keep the result within "~/.bibgrep.idx" (by defaults). It watches the modification date and the size of the original BibTex file, and will update (and delete) its index as needed.