Critical Mass Modula-3 is an easy-to-use and easy-to-install Modula-3 system that contains considerable enhancements over its ancestor DEC SRC Modula-3, including modules loadable at runtime, implicit exceptions (even for checked runtime and gc failures), COM-compatible object layout (for Win32), Unicode support, and 64-bit support for 64-bit machines.
EAsea Specification of Evolutionary Algorithms (EASEA), is a high-level language dedicated to the specification of evolutionary algorithms. The language and compiler are quite mature. EASEA compiles .ez specification files into C++ or Java object files, using existing evolutionary libraries. Supported C++ libraries currently are GALib or EO.
SUIF (Stanford University Intermediate Format) is an infrastructure designed to support collaborative research in optimizing and parallelizing compilers. SUIF1 includes a SUIF-to-Fortran backend, a graphical browser, a parallelization system, and a call-graph library. SUIF2 includes Java and C frontends, object-oriented extensions, and an intraprocedural dataflow framework.
Kelly is a JBuilder 4 & 5 plugin that makes it easy to deploy EJBs to JOnAS 2.x. Kelly can be installed and run with other JBuilder 4 & 5 plugins such as BEA WebLogicServer 5.1, BEA WLS 6, IBM WebSphere 3.5, Borland AS 4.5, etc. Kelly provides services to Jbuilder 4 & 5 java developers such as the ability to create any XML deployment files required by JOnAS 2.x, hot loading and unloading of any EJBs to JOnAS (only for JBuilder 5), control of JOnAS start-up from JBuilder 4 & 5, and the supply of JOnAS word dictionaries to JBuilder 4 & 5 in order to enhance the JBuilder 4 & 5 text completion services.
aiSee reads a textual, easy-to-read, and easy-to-learn graph specification and automatically calculates a customizable graph layout. This layout is then displayed, and can be printed or interactively explored. aiSee features 15 basic graph layout algorithms (including force-directed layout), recursive subgraph nesting, fish-eye views, and an animation interface. It has been optimized to handle huge graphs automatically generated by applications (e.g. compilers).