Add some notes about porting to Bordeaux threads
Reformat code, add documentation

* Reformat the code to lines of 96 characters or less.  This makes it
  easier to read the source on github (and in editors that don't wrap
  lines).
* Add some documentation and start to make the format of the existing
  documentation more consistent.
* Do some minor cleanups of the code.
Consistently use :stream keyword instead of :str
Change type of learning rates to double-float

This avoids floating-point overflows on SBCL and is unlikely to cause
serious performance or space degradation.
Force output of progress printer

Also clean up code for tests.
Fix Concurrent ALisp

* Make Concurrent ALisp compile and run on Allegro CL again
Add larger test case for sequential ALisp
Remove ECL *.fas files
Add support for ABCL.

Also:
* Fix documentation in QE-Taxi example
* Force progress output in ALISP:EVALUATE
* Fix some formatting errors in the code
Add IGNORABLE declaration in MAKE-3PARTQ-FEATURIZER
Implement CHOICE-DIST for <GREEDY-POLICY>
Add SHORTEST-PATH function to grid worlds.

* Add %NEXT-NODES slot to <GRID-WORLD>.
* Add NEXT-NODE method.
* Extend Floyd–Warshall algorithm to compute index of highest
  intermediate node as well as distance.
Add explicit generic functions
Allow keyword arguments for %SHORTEST-PATH and %NEXT-NODE in <GRID-WORLD>.
Fix bug in SHORTEST-PATH

Also correct typo in initarg :END-NODE of NO-PATH-CONDITION.`
Work around missing arglist info in ECL

* Provide DEFUN* macro that is similar to DEFUN but creates a
  funcallable instance that stores its lambda list.
* Define funcallable class ALISP-FUNCTION for the result of DEFUN*.
* Depend on Closer MOP so that ALISP-FUNCTION can be defined in a
  portable manner.
Fix compilation notes on SBCL
Use named lambda for DEFUN* on SBCL
Add additional assertion in INFORM-ENV-STEP
Add missing dependency for SBCL