gobba is a dynamically typed and purely functional interpreted programming
language, heavily inspired from the OCaml, Haskell and Scheme languages. It is
based on Professors Gianluigi Ferrari and Francesca Levi's
interpreter example. The goal for gobba is to be a practical language with built
in support for scientific computing, solving some of the problems that exist in
primary goal is also to offer a compromise between solidity, ease of learning and
the ability to express ideas quickly in the language.
C and Haskell-like syntax with lexical scoping
Only immutable variables
Eager (default) and lazy evaluation
Simple but effective module system
Interactive REPL with readline-like features such as completion, search and hints
The REPL has didactical debugging option to print expression ASTs and every reduction step.
Static inference to separate pure and impure computations
A lot more coming in the next releases...
Check out the Basics Chapter in the Gobba Handbook.
You can read the Gobba documentation in the Gobba Programming Language Handbook
The internal documentation is available
here. Please note that the language at the
current status is in an experimental phase and therefore the specification is
not complete, and will be constantly updated. The documentation may not be up to
date with the latest features in the
To install, you need to have
opam (OCaml's package manager) and a recent OCaml
distribution installed on your system.
gobba has 3 main development dependencies you have to install on your system:
These packages may or may not be present in the package repositories of your operating system.
If they are, please be sure to install the development versions of these packages.
You can install gobba by running
opam install gobba
If you want to compile gobba manually, read the installation chapter in the gobba Handbook
examples/ directory for some example programs.
>= "1.4.1" & < "2.6.0"
with-test & >= "0.8.5"