Open Source Compilers

CLISP is a portable ANSI Common Lisp implementation and development environment by Bruno Haible. Interpreter, compiler, debugger, CLOS, MOP, FFI, Unicode, sockets, CLX. UI in English, German, French, Spanish, Dutch, Russian, and Danish.

GNU Prolog is a free implementation (under GPL) of the logic programming language PROLOG. It can compile to native machine code which is extremely fast in execution. Another feature is the included constraint solver.

Apache TVM is an open source machine learning compiler framework for CPUs, GPUs, and machine learning accelerators. It aims to enable machine learning engineers to optimize and run computations efficiently on any hardware backend. The vision of the Apache TVM Project is to host a diverse community of experts and practitioners in machine learning, compilers, and systems architecture to build an accessible, extensible, and automated open-source framework that optimizes current and emerging machine learning models for any hardware platform. Compilation of deep learning models in Keras, MXNet, PyTorch, Tensorflow, CoreML, DarkNet and more. Start using TVM with Python today, build out production stacks using C++, Rust, or Java the next day.

Modern scripting language and the first one that presents the concept of programming with direct fiction description using a clear subset of pure human language. Using Supernova you can write the source code using Arabic and/or English keywords and you can create GUI applications for Windows and Linux.

The Introspector enables the programming tools that deal with source code such as the compiler to communicate in a standard and neutral manner reducing the accidental cost of programming. http://github.com/h4ck3rm1k3/

Flora-2 is a powerful knowledge representation and reasoning system designed for building knowledge-intensive applications. It is based on F-logic, HiLog, Transaction Logic, and also supports defeasible reasoning. Applications include intelligent agents, Semantic Web, ontology management, and more. If you use Flora-2 and like it, please acknowledge it in your project!

The ECLiPSe Constraint Logic Programming System is designed for solving combinatorial optimization problems, for the development of new constraint solver technology and their hybrids, and for the teaching of modelling, solving and search techniques.

EXTE recognizes temporal expressions in a text. Temporal expressions are any references to the TIME e.g.: "today", "12th march 2006", "as soon as he woke up". This analyzer will recognize three languages: Spanish, English and French.

This project was previously oriented towards creating an AI based Operating System. However new visitors should refer to www.theasciiproject.com for information about what this project has developed into.

This is a compiler which produces ANNs out of a simple, procedural programming language. Those programs can then be subject to genetic algorithms and neuro-evolution to enhance them automatically.

Metaprogramming: proof of the concept.

Erc is an interpreted link-oriented language. Majic is a java-based interpreter for Erc, and Majicc is a c++ based compiler for Erc which uses the Majic libraries.

Compiler optimization for code that AI generates, reuses similar substrings of code to exponentially reduce the Big-O of compile. At runtime, CodeTree objects breed, rename vars, mutate code and run it instantly. For any realtime compilable language.

JPIE is an implementation of an Open Source Java to Prolog/Prolog to Java interoperability mecanism based on the Java VM.

lightJacc is a small but strong grammar parser generator. It adopts a parsing strategy of its own: dynamic concurrent parsing -- which made it much stronger than LR or LL family CCs (YACC, ANTLR, etc), but still keep good performance.

RCXJavaC A Java like compiler for the Lego Mindstorms Robotics kit.

Regulus is a Prolog-based toolkit for building spoken dialogue systems.

RuleWorks is a rules-based application development tool providing the convenience of cross-platform development combined with one of the most powerful high level rules-based languages and fastest inference engine.

Rule-action based term rewriting framework, designed be embedded in Java applications.

The Yap Prolog System is a ISO-compatible high-performance Prolog compiler. Yap is widely considered one of the fastest available Prolog systems. Yap supports coroutining, CLP(QR), CHR, and depth-bound search. Tabling and parallelism are in development.

A C++ port (a redesign implementation actually) of the CLIPS expert system . This will be done along the lines of the Java port Jess, but full CLIPS backwards compatability will be maintained (even to the API level where possible).

CLearJ is a clean Java-implementation of Common Lisp. The big goals are ANSI standard compliance, interoperability with Java and integration with scripting environments. This project is meant to be a sibling to CLearSharp, with sharing of implementation.

CLearSharp is a clean C#-implementation of Common Lisp. The big goals are ANSI standard compliance, interoperability with Java and integration with scripting environments. This project is meant to be a sibling to CLearJ, with sharing of implementation.

The CommGen platform is intended to be a simple, scalable integration platform for small to medium problem sets. The architecture is simple, consisting of a distributed kernel, distributed O/S, agent and application layer.