Open Source Java Mathematics Software for BSD

IDL specified API for manipulating and processing CellML 1.0 and 1.1. Includes C++ implementation. Accessible from a C++ program, or from any language for which a CORBA language mapping is available Also, a Java wrapper of the API is available.

DragMath is a drag and drop equation editor in the form of a Java applet. Once an expression is created the user can convert it into a variety of different linear syntax for mathematics, including MathML, LaTeX, Maple, Maxima or any user defined style. PLEASE NOTE: active code development has moved to GitHub. https://github.com/maths/dragmath

In the tradition of Hilbert's program we create a formal correct (checkable by a proof verifier) but readable (like an ordinary LaTeX textbook) mathematical knowledge base which is freely accessible within the internet. Logic and set theory started.

Easy Equations is a utility using which one can write the mathematical equations. The focus of this utility is to provide user friendly access to write mathematical equations which is helpful for students, lecturers, mathematicians and Research persons who prefer using mathematical equations in a document, PowerPoint or web sites. Works on Windows as well as Linux platforms. Software Requirements: JDK 7 or higher. Linux Platform with kernel version 2.7 or higher.(for Linux users).python necessary only in linux environment to use COPY functionality.python is pre installed in recent linux distributions.

The project Intergeo co-funded by the Community programme eContentplus develops an open-source library for the common file format it defines to allow developers of dynamic geometry systems to quickly integrate read support for such files.

Narvik is a tool for conducting numerical and visual analysis in cartography.

TekMath is a java/swing-based viewer for the Math Markup Language (MathML) that can be easily embedded in custom java applications. It supports both content and presentation markup languages, and depends on no external packages beyond the java runtime.

Not working yet. To deal with the Halting Problem, computing and data are navigated using debugger ops: linearForward and treeForward, which navigate an astronomically large bit string where 1 is ( and 0 is ). All pairs are derived from (). For example, true is represented as ((()())()), and false is (()(()())). It appears related to the church encoding of lambda where T chooses first parameter and F chooses second, of a pair. Continuations are nearly finished code and are represented as a pair of stack and queue. The stack is a linked list of pair of true or false and object pushed on the stack. The queue is also such a linked list but is paired oppositely so previous queue state goes on the left and next object queued on the right of the new pair, so when the queue is navigated in sequence of that astronomically long bitstring (thats exponential of reusing objects in the acyclicNet), the Nav32 (using linearForward and treeForward for random access) first sees the oldest object queued