a lightweight, robust, scheme-like lisp implementation
Switch branches/tags
Nothing to show
Clone or download
JeffBezanson Merge pull request #52 from jniewerth/patch-2
Fix "use-after-relocate" in stream_to_string
Latest commit 983c847 Aug 21, 2017
Permalink
Failed to load latest commit information.
attic remove and clean up some old files Jun 11, 2013
examples remove and clean up some old files Jun 11, 2013
lib a rename Feb 17, 2012
llt Both clang and gcc define both MACOSX and ARCH_X86_64, no need to exp… Aug 13, 2017
tests fix bug in printing the character #\x0 Aug 19, 2017
tiny Make FreeBSD a "first class citizen" among femtolisp's build OSes. Apr 11, 2015
.gitignore gitignore flisp.boot.bak Jun 11, 2013
LICENSE moving stuff around some more Feb 17, 2012
Makefile Make FreeBSD a "first class citizen" among femtolisp's build OSes. Apr 11, 2015
Makefile.macosx Both clang and gcc define both MACOSX and ARCH_X86_64, no need to exp… Aug 13, 2017
README.md Add Gitter badge. Jan 2, 2017
aliases.scm fix #24, make `<=` and `>=` work on strings Sep 17, 2016
ascii-mona-lisa moving stuff around some more Feb 17, 2012
ascii-mona-lisa-2 moving stuff around some more Feb 17, 2012
bootstrap.sh moving stuff around some more Feb 17, 2012
builtins.c add math library functions sqrt, exp, log, sin, cos, tan, asin, acos,… Aug 19, 2017
compiler.lsp fix lack of error when calling builtins with the wrong number of args Aug 26, 2013
cvalues.c Fix * and + to return inexact when given inexact args. Aug 9, 2017
equal.c lower `BOUNDED_COMPARE_BOUND`, allowing r7rs `equal` benchmark to com… Aug 19, 2017
equalhash.c moving stuff around some more Feb 17, 2012
equalhash.h removing leading/trailing underscores from preprocessor symbols Feb 20, 2012
flisp.boot fix #24, make `<=` and `>=` work on strings Sep 17, 2016
flisp.c Argument to abs() is actually long, not int, thus use labs(). Aug 13, 2017
flisp.h several minor changes and additions: Jun 8, 2013
flmain.c Merge branch 'master' of github.com:JeffBezanson/femtolisp Jun 8, 2013
iostream.c Fix "use-after-relocate" in stream_to_string Aug 20, 2017
mkboot0.lsp moving stuff around some more Feb 17, 2012
mkboot1.lsp moving stuff around some more Feb 17, 2012
opaque_type_template.c moving stuff around some more Feb 17, 2012
opcodes.h removing leading/trailing underscores from preprocessor symbols Feb 20, 2012
operators.c fixing large int64 comparison bug Mar 15, 2012
print.c don't print-circle in `princ` mode Aug 19, 2017
read.c several minor changes and additions: Jun 8, 2013
string.c add function `char-alphabetic?` Aug 19, 2017
system.lsp fix #24, make `<=` and `>=` work on strings Sep 17, 2016
table.c several minor changes and additions: Jun 8, 2013
todo moving stuff around some more Feb 17, 2012
todo-scrap moving stuff around some more Feb 17, 2012
types.c Eliminated caching of overconstrained array types for cvalues Aug 18, 2017

README.md

Join the chat at https://gitter.im/FemtoLisp/flisp

...a purely symbolic gesture...

This project began with an attempt to write the fastest lisp interpreter I could in under 1000 lines of C. It snowballed from there as I kept trying to see if I could add powerful features with minimal code. At the same time I assembled a library of some of my favorite C code (by myself and others) to use as a base for a standard library. This includes ios, a replacement for parts of C's stdio that adds more flexible features.

Before you say "oh no, another lisp", consider the following: femtolisp is about 150kb, is very self-contained, and has the following features:

  • vectors, strings, gensyms
  • backquote
  • exceptions
  • printing and reading circular/shared structure
  • all values can be printed readably
  • prettyprinting
  • hash tables
  • support for directly using C data types ala Python's ctypes
  • equal and ordered comparison predicates that work on circular structure
  • proper tail recursion
  • io and memory streams with utf8 support
  • highly compatible with Scheme, including some R6RS features
  • simple, well-organized, powerful API with as few functions as possible
  • compacting GC
  • and...

...it is fast, ranking among the fastest non-native-compiled Scheme implementations. It achieves this level of speed even though many primitives (e.g. filter and for-each) are written in the language instead of C. femtolisp uses a bytecode compiler and VM, with the compiler written in femtolisp. Bytecode is first-class, can be printed and read, and is "human readable" (the representation is a string of normal low-ASCII characters).

femtolisp is a simple, elegant Scheme dialect. It is a lisp-1 with lexical scope. The core is 12 builtin special forms and 33 builtin functions.

A primary design goal is to keep the code concise and interesting. I strive to have each concept implemented in just one place, so the system is easy to understand and modify. The result is high reliability, because there are fewer places for bugs to hide. You want a small core of generically useful features that work really well (for example, see torture.scm).

Almost everybody has their own lisp implementation. Some programmers' dogs and cats probably have their own lisp implementations as well. This is great, but too often I see people omit some of the obscure but critical features that make lisp uniquely wonderful. These include read macros like #. and backreferences, gensyms, and properly escaped symbol names. If you're going to waste everybody's time with yet another lisp, at least do it right damnit.

Another design goal is to avoid spurious novelties. Many others offering their own "shiny new" lisp dialects get carried away and change anything that strikes their fancy. These changes have no effect except incompatibility, and often make the language worse because the new design was not as carefully thought out and has not stood the test of time. For example, how does it help to remove backquote? One design changes the syntax of quote. Some systems disallow dotted lists. (I've seen all three of these.) What's the point? Implementers wave the banner of "simplicity", yet wedge in all kinds of weird implicit behaviors and extra evaluation rules.

Lately a surprising amount of FUD has been spread about tail call optimization. I agree that not every language needs it, but I would like to refute the idea that it makes interpreters slow. Look at the "tiny" subdirectory or the "interpreter" branch to see a pure s-expr interpreter with efficient TCO. All you have to do is keep track of whether you're in tail position, which can be done very cheaply. These interpreters are difficult to beat for speed, yet they have lexical scope and TCO.

This project is mostly a matter of style. Look at the code and you'll understand.

This is what I do for fun, because it is the exact opposite of the kind of thing people will pay for: an obscure implementation of a programming language everybody hates.