Starting with inventory:
0000003294-1eb3b3c44a74063f8bc3cd34305b5f111b56236e224cda682e2d8cda1ada128e
[TAG uvsakvufomi
John Meacham <john@repetae.net>**20061123022856] 
hash: 0000001951-3dc7b3777aea81ee77b198c0254480293c814ceb6ef12f1fe670f34d39222de3
[clean up code a bit
John Meacham <john@repetae.net>**20061123032401] 
hash: 0000001256-56dc2c92fdc16e22f6b52bc4937894c5ab145b386f8d1400192241d0ee46debc
[if a ho file depends on a library we don't have loaded, then consider it out of date.
John Meacham <john@repetae.net>**20061123034901] 
hash: 0000001502-98f461c11ff542a0c4f06257cb658a52c6d6ee0deaef39f25fbe97ff87c75d1d
[perform final cpr, demand, and workwraping after de-typing and boxification of program
John Meacham <john@repetae.net>**20061125020104] 
hash: 0000003067-75f10f26a994d95ecf77292406410be0672b5285c64263521f46969351258f81
[make inline checking work for anything in the HasProperties class
John Meacham <john@repetae.net>**20061125024642] 
hash: 0000001055-cc8d508e134bbe61706eb61a97895a46c1e2baddb8185f83698999ba5f52e02e
[allow workwrapping of workers
John Meacham <john@repetae.net>**20061125024804] 
hash: 0000000455-565bcc706dfb0370ada977f0738cdcf4bc248fa3911b0dd12e1141e117eef32d
[don't reget properties structure out of tvrInfo unnecesarily
John Meacham <john@repetae.net>**20061125024829] 
hash: 0000000882-bef4c14223cdce189c5d4cf213b9d4e70d959cf7e35d6972bda52528f55e8ff5
[when chopping statistics, maintain proper counts
John Meacham <john@repetae.net>**20061125024852] 
hash: 0000000325-2fae89047da9b4f274156328f0e8a30658b396faae1483edec101efb7b079537
[add programMapProgGroups to generate and modify subprograms in dependency groups.
John Meacham <john@repetae.net>**20061125041703] 
hash: 0000003298-0684da514254020f178ecdf4cc9a047fee5ef7df5c26b318f8eb8cd515a64989
[clean up code, rearrange things a bit.
John Meacham <john@repetae.net>**20061125054556] 
hash: 0000004523-6538c82e13bdd44e70d90905c8804e8799cba8bd7c61fdf7065226adc0248a74
[fix bug in printing of core, don't clear program entries by accident in E/Inline.hs
John Meacham <john@repetae.net>**20061125064213] 
hash: 0000000573-690938bf6c0fc2bdb06081aa3b3f492a1b25ad7263bde2a9aaba4c1c6686827d
[Graph components should return all components, not just strongly connected ones
John Meacham <john@repetae.net>**20061125070336] 
hash: 0000000222-c7a6b003624a1eb489369510b602809e9c0c39f1eff524173bdc3cd76499d772
[add routine to split program into independent components, get rid of progClosed field in program in favor of progType.
John Meacham <john@repetae.net>**20061125113959] 
hash: 0000003128-72ff51d20f786c105a796fb755620f5690c3b0a737265938a0422c1ad308d124
[add Show instances for IdMap and IdSet
John Meacham <john@repetae.net>**20061125122752] 
hash: 0000000965-f0fce7366ea6a5d8ffdf60a943e30a2b7d59829eb4bc8cc9e82d5adeb7c998c2
[move core definition to E.Type
John Meacham <john@repetae.net>**20061126104731] 
hash: 0000012372-321369b44e64b5393b5a109fb4048f7893ce76eb3f554a18679c62b86f986198
[make freeVars take rules into account by default. Move a bunch of code around. move E binary stuff to E.Binary
John Meacham <john@repetae.net>**20061127040207] 
hash: 0000016127-a0c5946437fb73984d4aa7a3e8338bc185aae2658afd3bf8cb2db26f614017d7
[make sure rules are properly applied to currently compiling module, rearrange some code.
John Meacham <john@repetae.net>**20061127071323] 
hash: 0000003571-23865bac6036998050b9b7a730b881f2a71f4f4bd8a551f1085c2c21da518f1c
[only perform static argument transformation when there are real recursive applications, not just ones via rules
John Meacham <john@repetae.net>**20061127075831] 
hash: 0000002497-b7d1012f03a43d51d7b84505aa773c7985725ff19f89618a2b30d66433e6ea75
[make Char enumFromThenTo instance strict in its argument.
John Meacham <john@repetae.net>**20061127093930] 
hash: 0000000230-7dd2bf75f826822fcffa998bbcef2d1b9aa98ef537491b46c21f2aca25a91405
[perfrom static argument transformation on non-toplevel recursive definitions too when at least one argument can be eliminated.
John Meacham <john@repetae.net>**20061127100119] 
hash: 0000000894-5926e1e7dd880b32b0ebbcec60565ff728fff1fa69ad5274e1beaf793c5766e6
[cache free variables inside of ECase terms always. lazy evaluation assures we don't pay a cost for this
John Meacham <john@repetae.net>**20061128020643] 
hash: 0000008982-cbd5d72d1d910d6f5eb651451e6e5e2f2e1033bf3199d3944834f22bdbc33bff
[remove names in the head of rules from the free variables in their body. the rule will never fire if the head names are not in scope.
John Meacham <john@repetae.net>**20061128042900] 
hash: 0000001130-48c0abe1375277fc207dd9528340d41f12c4749844b9bbe8589dfcf0fc117021
[switch main optimization pass to use new Program framework
John Meacham <john@repetae.net>**20061128063326] 
hash: 0000003901-ddc41080d86dbe6e5fb5e6ed06a237c78206365d0fdf6133f75ee6796d1155b7
[fix static argument transform so that it doesn't re-recurse into previously processed terms
John Meacham <john@repetae.net>**20061129010948] 
hash: 0000000838-a6a9b23c1fa286d2b4000a72407642f3a4cacf530799eb1e280df1984f0043f2
[add transformSkipNoStats which means a transformations return result should be tossed if no statistics were generated.
John Meacham <john@repetae.net>**20061129011959] 
hash: 0000001093-710e711310472f9d60873b4c3e0764860f5a150855dfcc4af69b3f0a2b402dca
[make StatM monad strict in its statistics gathering field
John Meacham <john@repetae.net>**20061129020225] 
hash: 0000001102-559ca4a2d8652b55b2d814846feea35b2d79919d651d836877df9109b3d689cd
[make SM monad for simplification
John Meacham <john@repetae.net>**20061129020641] 
hash: 0000004653-0297372a584e42ef26531c29195ab937a75fbed54e56e685014e56fcf0e6a409
[add Util.RWS, a RWS compatable Monad that is strict in its fields
John Meacham <john@repetae.net>**20061129023816] 
hash: 0000004760-54ab5ee166e9f2a105770353968da5b871e56726a625c89803dcc879a905bed0
[get rid of 'inb' argument to simplifier, in favor of the one that is handed around in the monad
John Meacham <john@repetae.net>**20061129033503] 
hash: 0000019487-c7c73f0bdb0546d9dae4b3350addab176689022915c482b3687770827d415f26
[include a context continuation when simplifying
John Meacham <john@repetae.net>**20061129055011] 
hash: 0000006591-28ef702cb095287e6cba0dce499a0f5e34ed8ff0d7d5aad1c1782f6bba0c3fe1
[rearrange more of the simplifier, push contexts into lets, when doing the case-improve-default optimization, have the simplifier keep going.
John Meacham <john@repetae.net>**20061129065537] 
hash: 0000004413-31cdaa758a4198522db2e02a02ca9fe912838663e7c5ef3a919bf226440b1190
[make printing of case statements a bit less verbose
John Meacham <john@repetae.net>**20061129081936] 
hash: 0000000711-b970625cfc8c8d959e399e5d69a52d475ab8afc140cc9b04d6cc7af5d3b2b2a8
[remove redundent check for bad applications and let the type checker figure it out.
John Meacham <john@repetae.net>**20061129081957] 
hash: 0000000355-0d4e0916ff03a2b47f4883c28205641a3043ce0269187546c46f2a3d6eefd5d0
[push continuation into case branches in simplifier, re-enable some optimizations that depend on the environment
John Meacham <john@repetae.net>**20061129104337] 
hash: 0000019799-c386ca3e3b8577daa92587ff0bc073bb9835cf54e0bd4bff69bb370e0f3a5d8a
