Hello, we are happy to present Flea Scheme, a submission for the Programming Language Jam! See below for all the details. Unfortunately the submit form didn't have our Repl as an option for the dropdown, but you can find it here: https://repl.it/@fleascheme/fleascheme#main.scm Simply running the repl should boot you into a Flea Scheme repl.
You can find the code, as well as the following README on Github over here: https://github.com/flea-scheme/fleascheme-repl.it
Welcome to Flea Scheme
Flea Scheme is a very small toy Scheme implementation that is meant to be a
playground to explore linear logic. The big idea of Flea Scheme is to invert
the following rule:
All objects created in the course of a Scheme computation, including
procedures and continuations, have unlimited extent. No Scheme object is ever
In Flea Scheme, each binding must be referenced exactly once, and objects are
destroyed as soon as the binding holding the value is referenced. Other than that
the goal is to support as much of the R7RS Scheme specification as possible. So
Flea Scheme is an example of Mandatory Manual Memory Management, or (m . ms) for
short (pronounced M&Ms... ba dum tssh). Think Rust, but more annoying.
Please be aware that when we say small, we mean very small. Of the Scheme special forms we have implemented
quote. Of the built in procedures, only
newline are available. We hope you find it as engaging as we have though!
Special care does need to be taken in dealing with conditionals. First and
foremost, both arms of a conditional must reference the same bindings. If the
true branch of an
if expression references the variable
x but the false
branch does not, then
x will not be used exactly once in all scenarios.
Secondly, it is very common to need a variable in both the test, as well as the
body of an
In order to support referencing an object more than once, Flea Scheme does
dup primitive, it will copy an existing object without destroying
it. For example in this implementation of FizzBuzz the
are only destroyed when handling the recursion at the end of the procedure, all
other references to them go through
(define (fizzbuzz x y) (display (if (= (modulo (dup x) 15) 0) "FizzBuzz" (if (= (modulo (dup x) 3) 0) "Fizz" (if (= (modulo (dup x) 5) 0) "Buzz" (dup x))))) (newline) (if (< (dup x) (dup y)) (fizzbuzz (+ x 1) y) ;; When done, `x`, `y`, and `fizzbuzz` must be destroyed (begin x y fizzbuzz)))
In order to convey how linear logic differs from the intuitionistic logic that
we are familiar with, let us consider a few examples.
(define (foo x y z) (if x (+ y 1) (+ z 1))
In pure Scheme this is fine, if
x is true, then
y is incremented and
z is incremented and returned. However in Flea Scheme this
is an error.
* (define (foo x y z) (if x (+ y 1) (+ z 1)) => *unspecified* * (foo #t 1 2) Error: [fapply] Unused bindings:((z . 2)) * (define (foo x y z) (if x (+ y 1) (+ z 1)) => *unspecified* * (foo #f 1 2 ) Error: [fapply] Unused bindings:((y . 1))
Notice how there is an error because either
z will be unreferenced.
In Flea Scheme, you must discard unused variables manually:
* (define (foo x y z) (if x (begin z (+ y 1)) (begin y (+ z 1)) => *unspecified* * (foo #t 1 2) => 2 * (define (foo x y z) (if x (begin z (+ y 1)) (begin y (+ z 1)) => *unspecified* * (foo #f 1 2) => 3
Referencing a binding more than once is also an error:
* (define (foo x) (if x x #f)) Error: [free-variables identifier?] Unbound identifier: x
Instead, one must declare the intention to re-use a binding:
* (define (foo x) (if (dup x) x (begin x #f)) => *unspecified* * (foo 1) => 1 * (define (foo x) (if (dup x) x (begin x #f)) => *unspecified* * (foo #f) => #f
Also note, that after referencing a defined variable we must re-define the
variable in order to use it again. This is of course, because the object is
destroyed when it is referenced.
* (define foo 1) => *unspecified* * foo => 1 * foo Error: [feval-identifier] Unbound identifier: foo *
Flea Scheme was built for the 2020 repl.it Programming Language Jam. To try it
out all you have to do is cruise over to
and hit the big Run button. Be warned however, that it is a very frustrating
experience at the moment. Flea Scheme has pretty much only been implemented
to successfully run the FizzBuzz function above. There are several gotchyas.
First, once you define a procedure, that procedure is destroyed as soon as it is
applied. Second, if the underlying Biwa Scheme implementation encounters an
error, then the Repl will hang, as there seems to be no way to catch the raised
Second, if an expression is entered into the repl that contains a newline, Flea
Scheme will be unable to parse the expression, and will error with a very
cryptic message. For example,
* (define (foo x) x) => *unspecified* *Error: [feval-identifier] Unbound identifier: x
While without the newline, everything is fine:
* (define (foo x) x) => *unspecified* * (foo 1) => 1
Rather than coming up with some fresh new ideas for the Programming Language Jam
Flea Scheme revives some rather stale ideas from 1991 that perhaps should have
seen some more love.
The main inspiration for Flea Scheme is Henry Baker's paper titled
"Lively Linear Lisp -- 'Look Ma, No Garbage!'", which was once available here:
Linear logic can be helpful in dealing with certain types of data that must be
cleaned up. In addition, because objects are destroyed when they are referenced,
a Flea Scheme program comes in Static Single assignment form out of the box. On
top of that, it is impossible for two pointers to ever alias each other. These
last two points can be very helpful to an optimizing compiler.
One can also look to Rust, which utilizes Affine Types. Affine Types are
similar to linear types in that they can be referenced at most once. Alexis
Beingessner talks about must-use types in Rust over here:
The Pain Of Real Linear Types in Rust
There are other programming languages that have some form of linear types, but
what would be really cool, would be to be open a repl and just give linear
logic a spin, which is where Flea Scheme comes in. If you know a little bit of
Scheme, you can go experiment with linear logic right now (we hesitate to say
linear types, because Flea Scheme is ultimately dynamically typed as any Scheme
Finally, it would be criminal to discuss linear logic without even mentioning the
work of Philip Wadler. He has written on the topic many times:
A good place to start for the uninitiated is his paper
A taste of linear logic.
Flea Scheme is implemented very similarly to the meta-circular evaluator
presented in chapter four of SICP. The main deviation is in the handling of
While the implementation of Flea Scheme is not meta-circular, it does give a
flavor of what it might be like to program with linear logic if Flea Scheme was
complete. This can be seen in the procedures that deal with the environment,
free-variables. The former searches the
environment for a binding, returning both the binding that is found as well as
the new environment. The latter extracts any free variables from the environment
that are captured by a closure.
In order to ensure that no variables are referenced more than once, each
evaluation step not only returns the result of the evaluation, but also a new
environment created by removing any bindings that are referenced in the
expression. For example, if the expression
foo is referenced with the
((foo . 1) (bar . 2) (baz . 3))
not only is the value
1 returned, but also the the new environment
((bar . 2) (baz . 3))
In order to ensure that all variables are referenced at least once, the
environment is verified to be empty after evaluating the last expression in a
There are a few exceptions:
- For convenience, primitive procedures provided by the underlying Scheme
implementation, are not destroyed. So, the expression
(+ 1 (+ 2 3))is ok
even though the
+procedure is referenced twice.
- Flea Scheme provides syntax to reference a binding without destroying it.
This syntax is named
dup, in honor of another paper by our good old friend
Henry Baker: "Linear logic and permutation stacks -- the Forth shall be first",
in which Baker equates Linear Lisp to Forth. A very fascinating read, indeed!
dupwill work with procedures as well as other types of data,
direct recursion is supported without special syntax by simply binding
the procedure itself before evaluating the procedure's body (if the procedure
is referenced in the body). This can be seen in the fizzbuzz example.
Flea Scheme does support closures, however any variables that are captured by
the closure will be removed from the enclosing environment. Therefore, the
following will be an error:
(define (foo x) (define (bar) x) x ; Error here as x has been moved to the closure bar )
Aside from supporting more of the Scheme specification, there are many ways to
make it easier to work with Flea Scheme.
First, it should be possible to provide static errors for an unused, or
over-used variable. If possible, this would also allow to automatically destroy
unused bindings, giving a bit more of a Rust feeling to the language. In fact
the current implementation of
free-variables would almost be amenable to
In Linear Lisp, Henry Baker makes extensive use of a destructuring
order to access both the
cdr of a
(dlet ((first second third . rest) '(1 2 3 4 5 6)) first) => 1
This is much more ergonomic than relying on
car+cdr. Flea Scheme does use
this destructuring let in its implementation, and it would be a handy thing to
include in the language itself. For Flea Scheme, the destructuring
would need to include support for multiple values.
It would be very interesting to bring the concept of borrowing from
Rust. Both Scheme, and many libraries already have a similar concept. Many
procedures that end with an exclamation mark, such as
find!, are so called
linear update procedures. That is because they invalidate the input data, therefore
referencing the original binding is undefined behavior.
It would be nice to allow annotations to define the behavior of a binding. That
way the programmer can decide if a given binding should be linear, affine,
infinite (garbage collected), or anywhere in between.
In short, virtually all programming languages make the important decision of
memory management for the programmer. In our opinion, exploring linear logic as
a means of memory management, is a step in the direction of empowering the
programmer to make the right decision for their program.