Age | Commit message (Collapse) | Author | Files | Lines | |
---|---|---|---|---|---|
2010-04-13 | * Use a symbol table to represent identifiers and attribute names | Eelco Dolstra | 1 | -2/+2 | |
efficiently. The symbol table ensures that there is only one copy of each symbol, thus allowing symbols to be compared efficiently using a pointer equality test. | |||||
2010-04-12 | * Don't use ATerms for the abstract syntax trees anymore. Not | Eelco Dolstra | 1 | -3/+2 | |
finished yet. | |||||
2010-03-23 | * Start of an evaluator that uses call-by-need (with thunk updating) | Eelco Dolstra | 1 | -1/+1 | |
instead of (memoised) call-by-name. | |||||
2006-09-04 | * Use a proper namespace. | Eelco Dolstra | 1 | -0/+6 | |
* Optimise header file usage a bit. * Compile the parser as C++. | |||||
2004-02-04 | * Use a map to lookup primops. | Eelco Dolstra | 1 | -3/+3 | |
* Various performance improvements in the evaluator. * Do not link against unused (and missing!) libraries (-lsglr, etc.). | |||||
2003-11-22 | * Maintain integrity of the substitute and successor mappings when | Eelco Dolstra | 1 | -0/+6 | |
deleting a path in the store. * Allow absolute paths in Nix expressions. * Get nix-prefetch-url to work again. * Various other fixes. | |||||
2003-11-19 | * Refactoring: put the Nix expression evaluator in its own library so | Eelco Dolstra | 1 | -0/+10 | |
that it can be used by multiple programs. |