The Egel Language

Egel is a very small toy language based on untyped eager combinator rewriting.

Possible uses are:

Egel is mostly a Lisp descendant and falls in the same category as Q. Conceptually, it predates Miranda, ML, or Haskell.

The programming style is similar to functional programming though the operational semantics is slightly novel.

Language features

Example code

namespace Fibonnaci (
  def fib =
    [ 0 -> 1
    | 1 -> 1
    | N -> fib (N-2) + fib (N-1) ]
)

using Fibonnaci

def main = fib 5

The Egel interpreter

The Egel interpreter is implemented in C++ and designed to go from reading the sources to evaluation fast, though these goals are somewhat at odds which each other.

The interpreter assumes that scripts are for small automation tasks where the computationally intensive part is done by calling native routines.

Internally, combinators are represented as referenced counted C++ objects and there is no garbage collector for light-weight seamless integration with C/C++. Also, the interpreter is stackless to later allow for concurrency.

Definitions are translated to bytecode in a small instruction set for portability.

The interpreter is being developed at the moment and is in a pre-release stage. It can only symbolically evaluate at the moment (which is most of the work, of course.)

Roadmap and mobile code

Egel is developed as a hobby project to explore some ideas the author has. The intention is to grow the language to support different math libraries and then move towards making the code mobile. The aim is to become a small data-center language for distributed ad-hoc computation; i.e., a light-weight solution for moving code to data fast.

You can find the sources on github. I blog about my progress on blogger. I started on a FAQ.

Thanks

I would like to thank Linus Torvalds for Linux, the GNU team for their command line tools and compiler chain, Bram Molenaar for VIM, GNOME for their desktop, and Redhat for providing me with a great operating system for the last twenty years.