Pike is an interpreted, object-oriented, dynamic programming language with a syntax similar to C. It includes a powerful modules system that, for instance, has image manipulation, database connectivity and advanced cryptography. It is simple to learn, does not require long compilation passes and has powerful built-in data types allowing simple and fast data manipulation.
Q is a powerful and extensible functional programming language based on the term rewriting calculus. When programming with Q, you specify a system of equations which the interpreter uses as rewrite rules to reduce expressions to normal form. Q is useful for scientific programming and other advanced applications, and also as a sophisticated kind of desktop calculator. The distribution includes the Q programming tools, a standard library, add-on modules for interfacing to various third-party libraries, and an Emacs mode.
ROOT is an OO framework for large-scale scientific data analysis and data mining. It contains an efficient hierarchical OO database, a C++ interpreter, advanced statistical analysis, visualization, introspection, documentation, networking, and GUI classes. The command/scripting language is C++, and large scripts can be compiled and dynamically linked in. Using the PROOF (Parallel ROOT Facility) extension, large databases can be analyzed in parallel. The system runs on all known POSIX platforms, Windows, and MacOS X.
RScheme is an object-oriented, extended Scheme implementation with a compiler that targets C or (RScheme's own) bytecodes. It has features expected from a modern language: an object system, reflection, modules, namespaces, safe macros, threads, a system call interface (including sockets), separate compilation, and persistence, as well as the formal basis and power of the Scheme programming language. RScheme also features a powerful, elegant foreign code interface.
Rhope is a dynamically typed dataflow programming language that also borrows some ideas from other paradigms. Unlike mainstream programming languages, statements are not necessarily executed in the order they are written, but instead based on their dependencies. Statements that do not share dependencies run in parallel. Most operations have value semantics (i.e. modifying an object makes a copy rather than changing the original) making this parallelism safe. For managing global state, Rhope has a transaction mechanism.