Search Results for "the gnu compiler collection"

aphasia is an advanced scripting language for the web. It features a type-safe core, C++ modules with signatures, an optimizing "compiler", higher-order functions, built-in database support, garbage collection, and more.

MLton is a whole-program optimizing compiler for Standard ML. MLton generates small executables with excellent runtime performance, utilizing untagged and unboxed native integers, reals, and words, unboxed native arrays, fast arbitrary-precision arithmetic based on GnuMP, and multiple code generation and garbage collection strategies. In addition, MLton provides a feature rich Standard ML programming environment, with full support for SML97 as given in The Definition of Standard ML (Revised), a number of useful language extensions, a complete implementation of the Standard ML Basis Library, various useful libraries, a simple and fast C foreign function interface, the ML Basis system for programming with source libraries, and tools such as a lexer generator, a parser generator, and a profiler.

The Archive of Formal Proofs is a collection of proof libraries, examples, and larger scientifc developments, mechanically checked in the theorem prover Isabelle. It is organized in the way of a scientific journal. Submissions are refereed.

The MLKit is a full-blown compiler for the programming language Standard ML. The MLKit implements most of the Basis Library and has support for ML Basis Files. The compiler runs on the Linux platform and targets the x86 architecture.

This project provides a compiler that compiles ML into code suitable for execution on small targets, including embedded ones. The compiler generates both C and Forth.

GMetaDOM is a collection of librares, each library providing a DOM implementation. Each DOM implementation is generated automatically by means of XSLT stylesheets.

A framework for generation of real-time numerical simulations of dynamical systems from differential and difference equations.

This is a collection of several simple functional languages all based on combinator graph reduction techniques for interpretation. For now there's only one package here: lazy-l, which is an interpreter for Alonzo Church's untyped lambda calculus.