Any sufficiently complicated program contains an ad-hoc, informally-specified, bug-ridden, slow implementation of half of some Lisp dialect.
Greenspun’s tenth rule
We have a Twitter! Follow us @otus_lisp.
Otus Lisp (Ol in short) is a purely* functional dialect of Lisp.
It implements an extended subset of the R7RS Scheme (PDF), including but not limited to some SRFIs. It is tiny (~ 64KB), embeddable and cross-platform. Provides a portable, high-level interface to call code written in another language.
You can use Ol in Linux, Windows, macOS, Android, Chromebook*, (Open/Free/Net) BSD, Solaris and other operating systems based on various hardware architectures (intel, arm, ppc, mips, etc).
Also, Ol is ported to the Web (in WebAssembly form) and can be used in Chrome, Firefox, Opera, Iceweasel, Epiphany, SeaMonkey, Luakit, Iceape, etc.
Already tested platforms
- x86: 80486, pentium, pentium 2, pentium 3, athlon, core 2 quad, core i3, core i5, core i7.
- x86_64: core 2 quad, core i3, core i5, core i7.
- aarch64: cortex-a53, cortex-a57, cortex-a75/a55.
- arm: armv5tejl, armv7l, arm920t, snapdragon 801.
- nearly planned, but not yet tested: arm926t, arm1136, cortex-a7, cortex-a9, cortex-a15, cortex-m3, cortex-m4.
- powerpc: Mac G4
- mips32: algor (P-5064)
- mips64
- fully supported, but not yet tested: m68k, microblaze, or1k, ppc64, sh4, spark, spark64, ztensa.
Tested operation systems/devices
- GNU/Linux: CentOS, Debian, Fedora, RHEL, SLE, ScientificLinux, Uninvention, openSUSE, Ubuntu.
- Windows: Windows 95, Windows 98, Windows ME, Windows NT, Windows 2000, Windows XP, Windows Vista, Windows 7, Windows 8, Windows 10.
- Unix: OpenBSD, FreeBSD, NetBSD.
- Android: all versions up to Android 10. Should work with all other versions.
- webOS: 2.0.
- macOS: Mojave. Should work with all other versions.
- Odroid: C1+.
- Minoca OS.
- LattePanda (Win10, Ubuntu 16.04).
Tested web browsers (asm.js based Ol version)
- Iceweasel 38.6.0 / Debian 6.0
- Epiphany 3.4.2 / Debian 6.0
- Chrome (37, 48, etc.) / Debian 6.0
- Luakit 1.8.0 / Ubuntu 9.10
- Opera 58.0.3135.65 / Windows 2008 R2
- SeaMonkey 2.33 / Debian 6.0
- Firefox (28, 36, 44, etc. ) / Debian 6.0
- Chrome (39, 44, 51, 71, etc.) / Windows 2008 R2
- Iceape 2.7.12 / Debian 6.0
Source code
Source codes can be accessed at the official github repo (check the README).
About
Otus Lisp is available under 2 licenses: MIT License and GNU (L)GPLv3 License.
This is incomplete list of Ol features:
- small and fast virtual machine (only 42kb* in binary code)
- high efficient (thanks for pure language functionality) garbage collector
- cross-platform (Linux, Windows, Unix, different BSD flavors, Android, macOS, etc.)
- cross-architecture (i586, amd64, arm, mips, etc.)
- 32- and 64-bit platforms support
- little- and big-endian platforms support
- text scripts can be compiled into binary form; can execute this binaries directly by virtual machine
- embeddable
- dynamic calls of “native” functions (from system libraries or other languages); can be invoked from this functions using transparent callback mechanism
- full range of functional features from functional world:
- continuations
- tail recursion
- coroutines
- functions as first class objects
- etc.
- limited mutators as small pleasant addition from imperative world
- and, at least, it’s a real Lisp!
You can immediately try Otus Lisp in the provided terminal on the left of this page without downloading and installing any binaries. For the more information please refer to the “Learn” paragraph at the bottom of this page.
Learn
You can immediately try Otus Lisp (ol) in the provided terminal on the left pane of this page. For example, type
(+ 1 2 3 4 5 6)Pressing “send to the terminal” button you will see 21.
Or you can try more interesting example
(fold * 1 (iota 99 1 1))which is another way of
(let factorial ((n 99))
(if (= n 0)
1
(* n (factorial (- n 1)))))This will produce factorial of 99 (99!) for you
> (let factorial ((n 99))
(if (= n 0)
1
(* n (factorial (- n 1)))))
933262154439441526816992388562667004
907159682643816214685929638952175999
932299156089414639761565182862536979
208272237582511852109168640000000000
000000000000
>
And a bit more complex example: how about Pi? I mean the calculation of the first 200 digits of Pi? Please be patient - on slower PCs this may take some time.
(define (pi total-digits)
(let loop ((q 1) (r 0) (t 1) (k 1) (n 3) (l 3) (digits total-digits))
(unless (eq? digits 0)
(if (< (- (+ (* 4 q) r) t) (* n t))
(begin
(display n) (if (eq? digits total-digits) (display "."))
(loop (* q 10)
(* 10 (- r (* n t)))
t
k
(- (div (* 10 (+ (* 3 q) r)) t) (* 10 n))
l
(- digits 1)))
(begin
(loop (* q k)
(* (+ (* 2 q) r) l)
(* t l)
(+ k 1)
(div (+ (* q (* 7 k)) 2 (* r l)) (* t l))
(+ l 2)
digits)))))
(print))
(pi 200)p.s.
- In fact, Otus Lisp is slightly extended towards traditional imperative programming, namely, limited mutators have been introduced. It helps to organize non-repetitive random number generator and to speed-up some imperative-oriented operations.
- Real virtual machine size depends on parget platform and enabled features. 42kb is typical size for Linux without including debug information, ffi and experimental inexact library, but including couple of internal safe checks, sockets, native library calls and sandbox. For other operation systems size can be as bigger as lesser (i.e. 79kb for win64 x86_64, 30kb for ubuntu64 armhf).
- Sandboxing works only under OS with SECCOMP (secure computing mode) - it’s GNU/Linux (and different Linux disctributives, Ubuntu, Debian, Suse, etc.). Supporting sandboxing under *BSD is in progress.
Copyright (c) 2015 - 2023 Yuriy Chumak