John Benediktsson 9e65ccaf9f compiler.tree.propagation.simple: check output types length.		2013-04-26 17:21:22 -07:00
..
builder	words: adding inline-recursive?.	2013-03-04 16:09:56 -08:00
checker	FFI rewrite part 7: compile callback bodies with the optimizing compiler	2010-07-28 00:49:26 -04:00
cleanup	compiler.tree: Fix compiler test with merge-state	2013-03-23 22:56:16 -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.tree.dead-code.simple: curry live-values.	2013-03-10 16:13:31 -07:00
debugger	compiler.tree.debugger: Remove make-assoc	2012-07-19 17:48:02 -07:00
def-use	compiler.tree: fewer namespace lookups.	2013-03-21 19:36:07 -07:00
escape-analysis	compiler.tree: fewer namespace lookups.	2013-03-21 19:36:07 -07:00
finalization	issue #358: Rename all of the words depends-on-* to add-depends-on*	2012-06-21 08:35:45 -07:00
identities	compiler.tree: Renamed high-level IR node constructors to <#foo> from #foo. Moving towards making classes/word names not conflict.	2011-11-06 23:02:45 -08:00
late-optimizations	…
modular-arithmetic	compiler.tree.modular-arithmetic: Fix test for iota change.	2013-03-23 17:12:16 -07:00
normalization	compiler.tree: Renamed high-level IR node constructors to <#foo> from #foo. Moving towards making classes/word names not conflict.	2011-11-06 23:02:45 -08:00
optimizer	…
propagation	compiler.tree.propagation.simple: check output types length.	2013-04-26 17:21:22 -07:00
recursive	compiler.tree.recursive: more use of hash-sets.	2013-03-08 12:34:23 -08:00
tuple-unboxing	compiler.tree.tuple-unboxing: simpler checks.	2013-03-10 09:36:52 -07:00
authors.txt	…
summary.txt	…
tree.factor	Now that #foo and ##foo are symbols we can remove a bunch of \	2011-11-12 22:04:26 -08:00