factor/basis/compiler/tree
John Benediktsson bf35114fec compiler: use hash-sets to track visited sets. 2013-03-08 11:04:47 -08:00
..
builder words: adding inline-recursive?. 2013-03-04 16:09:56 -08:00
checker
cleanup compiler.tree.cleanup: fix "-1 shift" tests. 2012-09-10 19:24:23 -07:00
combinators assocs: Add sift-keys and sift-values. Remove three other implementations 2012-08-23 22:36:10 -07:00
comparisons
dead-code compiler: Fix /mod simplications in dead-code, add unit tests. Fixes #544 2012-07-21 03:41:42 -07:00
debugger compiler.tree.debugger: Remove make-assoc 2012-07-19 17:48:02 -07:00
def-use compiler: use hash-sets to track visited sets. 2013-03-08 11:04:47 -08:00
escape-analysis
finalization issue #358: Rename all of the words depends-on-* to add-depends-on* 2012-06-21 08:35:45 -07:00
identities
late-optimizations
modular-arithmetic core: Throw an error when assigning a bignum to a fixnum tuple slot if the bignum doesn't fit. Fixes #594. 2012-08-03 14:59:59 -07:00
normalization
optimizer
propagation hash-sets: faster implementation based on hashtables. 2013-03-07 21:43:17 -08:00
recursive
tuple-unboxing
authors.txt
summary.txt
tree.factor