Tree @develop-0.3 (Download .tar.gz)
Version 0.3. Work-in-progress, subject to change.
Robin is a functional programming language with eager evaluation, latent typing, and a homoiconic syntax, based on a radically simple core semantics in which the macro, rather than the function, is the fundamental abstraction.
For more information, see the extended description below.
The Robin reference interpreter is written in (about 700 lines of) Haskell;
to use it you'll need an implementation of Haskell installed (typically either
ghc or Hugs).
If you have shelf installed, you can just run
If not, you can clone this repository,
cd into the repo directory, and run
to build the reference interpreter. (If you don't have
ghc, no executable will
be built, but the
bin/robin script will use
You can then run it on one of the example Robin sources in
eg like so:
You should see
To continue learning to program in Robin you can follow The Robin Tutorial.
If you have a few minutes to spare, and you have Falderal installed, you can run the test suite (consisting of more than 400 unit tests) by running
The tests that use only Robin's core semantics (
--no-builtins flag) are quite
slow, so you may want to skip them. You can skip them by running
For experienced programmers, Robin might be best described by listing the languages that have had the strongest influences on it:
Like Scheme, Robin is eagerly evaluated, latently typed, and homoiconic, and tries hard to be well-defined and system-agnostic, but (as you can read below) diverges significantly from Scheme in other ways.
Like Forth, Robin has a radically simple core semantics. There are 15 intrinsic operations; every symbol in the standard library is defined in terms of these intrinsics, while an implementation is free to provide its own (perhaps more efficient) implementation of any such symbol. (See also Pixley).
PicoLisp has both macros and functions, but in Robin, the macro, rather
than the function, is the fundamental abstraction. There is a
form, but it's defined as a macro!
Like Haskell, Robin is referentially transparent (often described as "purely functional") — mutation of values is forbidden. (Robin intentionally does not, however, adopt lazy evaluation or a static type system.)
Reactive programs in Robin are built by composing transducers which are driven by events and produce effects (which are modelled as further events), in a manner very similar to The Elm Architecture.
Arbitrary text can by embedded in a Robin program using a syntax very much like a "heredoc", except it is an S-expression.
Deserves at least a passing mention here, as one thing that Robin
discards from Scheme is its jargony terminology: no
For a full description of the Robin language, see the Robin specification document.
- appliances/ — test appliances for the literate test suite.
- bin/ — driver script, destination for executable when built.
- demo/ — contains HTML5 document demonstrating build to JS by Haste.
- doc/ — Tutorial, specification, rationale, etc.
- eg/ — example programs written in Robin
- src/ — Haskell source for reference interpreter.
- stdlib/ — normative definitions of standard library symbols.
- HISTORY.md — history of this distribution.
- TODO.md — plans.
git clone https://git.catseye.tc/Robin/
- Tiny correction to number of tests present. Chris Pressey 2 years ago
- Fix link. Chris Pressey 2 years ago
- A couple of more edits. Chris Pressey 2 years ago
- Clean up example programs. Chris Pressey 2 years ago
- Drop Mercurial support. Chris Pressey 2 years ago
- Add tutorial section on recursive function definitions. Chris Pressey 2 years ago
- Write more tutorial. Chris Pressey 2 years ago
- Update copyright year. Chris Pressey 2 years ago
- Update README. Chris Pressey 2 years ago
- Several edits to several documents. Chris Pressey 2 years ago