SLOCCount is a suite of programs for counting physical source lines of code (SLOC) in possibly large software systems. It can count physical SLOC for a wide number of languages. It can take a large set of files and automatically categorize their types using a number of different heuristics, and also comes with analysis tools.
The Objex Project (like the GNU Project) aims to develop a complete operating system composed of free and open source software. In contrast to the GNU Project, it aims to build a modern system that brings together all the recent advances in computer science, instead of a Unix-like system. "A complete system" means that it will include the kernel, a full suite of developers tools, user utilities, and a graphical user interface. It is based on OSKit, a framework and a set of utilities, drivers, and program code intended for operating system creation.
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.
OBJ3 is a program specification and proof system based on order sorted equational logic. It has been successfully used for research and teaching in software design and specification, rapid prototyping, theorem proving, user interface design, and hardware verification, among other things. It was the first language to implement parameterized programming and its module system influenced the designs of the Ada, C++, and ML module systems.
Gamma is a dynamically-typed, object-oriented, interpreted programming language that has been designed and optimized to reduce the time required for building applications. It supports the QNX/Photon and Linux/GTK GUI environments, and has a built-in library of over 300 functions. It cuts development times and offers run-time debugging by wedding a C-like syntax to a Lisp interpreter that has been optimized specifically for performance and memory usage.
BMDFM allows one to run an application in parallel on shared memory multiprocessor (SMP) systems. BMDFM automatically identifies and executes all parallelism of unparallelized programs due to the static and mainly dynamic scheduling of the data flow instruction sequences derived from the formerly sequential program. BMDFM's dynamic scheduling subsystem performs an efficient SMP emulation of Tagged-Token DFM to provide the transparent dataflow semantics for the applications. No directives for parallel execution are required. No highly knowledgeable parallel programmers are required.