factor/unfinished/compiler/tree/combinators/combinators-tests.factor

IN: compiler.tree.combinators.tests
USING: compiler.tree.combinators tools.test kernel ;

{ 1 0 } [ [ drop ] each-node ] must-infer-as
{ 1 1 } [ [ ] map-nodes ] must-infer-as
{ 1 1 } [ [ ] contains-node? ] must-infer-as
Stack checker and propagation now themselves infer, improve propagation pass 2008-07-23 01:17:08 -04:00			`IN: compiler.tree.combinators.tests`
Change high-level IR to not use 'successor' links; add normalization pass 2008-07-27 21:25:42 -04:00			`USING: compiler.tree.combinators tools.test kernel ;`
Stack checker and propagation now themselves infer, improve propagation pass 2008-07-23 01:17:08 -04:00
			`{ 1 0 } [ [ drop ] each-node ] must-infer-as`
Beefed up normalization pass cleans up stack usage, simplifying recursive propagation 2008-07-27 23:47:40 -04:00			`{ 1 1 } [ [ ] map-nodes ] must-infer-as`
Propagation now does method inlining; working on cleanup pass 2008-07-30 04:38:10 -04:00			`{ 1 1 } [ [ ] contains-node? ] must-infer-as`