about summary refs log tree commit diff stats
Commit message (Collapse)AuthorAgeFilesLines
* 169Kartik K. Agaram2014-10-291-11/+10
|
* 168Kartik K. Agaram2014-10-291-1/+4
|
* 167Kartik K. Agaram2014-10-291-37/+38
| | | | Make context a global.
* 166Kartik K. Agaram2014-10-291-3/+3
|
* 165Kartik K. Agaram2014-10-291-10/+10
|
* 164 - start of a simple tangling systemKartik K. Agaram2014-10-292-0/+31
|
* 163 - start of a simple assemblerKartik K. Agaram2014-10-292-2/+45
|
* 162Kartik K. Agaram2014-10-291-4/+4
|
* 161Kartik K. Agaram2014-10-291-2/+2
|
* 160 - fix stale editor testKartik K. Agaram2014-10-283-43/+24
|
* 159 - putting types table in test file was a bad ideaKartik K. Agaram2014-10-282-38/+41
| | | | We could no longer just create .mu files and run them on the command line.
* 158 - stop supporting non-numeric addressesKartik K. Agaram2014-10-281-36/+40
| | | | | That was relying on the underlying host lisp. Next we'll build a simple assembler to get back descriptive variable names.
* 157 - 'new-list' handles integersKartik K. Agaram2014-10-252-11/+55
|
* 156 - new primitive for lifting into tagged-types: 'save-type'Kartik K. Agaram2014-10-242-1/+19
|
* 155Kartik K. Agaram2014-10-241-2/+5
|
* 154 - current stretch goal is to parse the horizon fileKartik K. Agaram2014-10-241-0/+19
|
* 153Kartik K. Agaram2014-10-243-276/+333
|
* 152Kartik K. Agaram2014-10-181-70/+70
|
* 151Kartik K. Agaram2014-10-182-485/+492
|
* 150Kartik K. Agaram2014-10-162-0/+1356
|
* 149 - get rid of 'type' and 'otype' in favor of tagged types for dispatchKartik K. Agaram2014-10-142-71/+61
|
* 148 - better idiom for generic functionsKartik K. Agaram2014-10-142-93/+123
|
* 147Kartik K. Agaram2014-10-142-44/+44
|
* 146Kartik K. Agaram2014-10-141-1/+1
|
* 145 - delete random programsKartik K. Agaram2014-10-145-48/+1
| | | | | | | | | They need a type table to work, but I'm keeping type tables next to the tests. Everything needs to be a test from now on. (But first some fixes to the terminal primitives.)
* 144Kartik K. Agaram2014-10-142-5/+17
|
* 143Kartik K. Agaram2014-10-121-7/+7
|
* 142 - helper for listsKartik K. Agaram2014-10-122-1/+8
| | | | | Amazing how easy it was to just dump the trace and diff, compared to my old approach of adding new traces and rerunning.
* 141 - list nodes using tagged-valueKartik K. Agaram2014-10-121-1/+46
|
* 140Kartik K. Agaram2014-10-122-4/+35
|
* 139Kartik K. Agaram2014-10-121-1/+14
|
* 138Kartik K. Agaram2014-10-121-5/+3
| | | | | | | | Current todo stack: trace-based assert new-tagged-value - assert that first arg has size 1 test constructing list manually new-list
* 137Kartik K. Agaram2014-10-122-5/+40
|
* 136 - log memory in consistent orderKartik K. Agaram2014-10-121-1/+1
| | | | | This is super slow. Maybe I should keep it commented out until we need it? Open to doing that in future.
* 135Kartik K. Agaram2014-10-121-0/+16
|
* 134 - 'arg' explicitly tells us if an arg was foundKartik K. Agaram2014-10-122-1/+17
| | | | | | Return values can be ignored in mu, in the grand traditions of C programming. Though library writers can impose their conservatism on callers by returning the error condition first.
* 133 - handle missing args without errorKartik K. Agaram2014-10-122-2/+17
|
* 132Kartik K. Agaram2014-10-111-2/+3
|
* 131 - maybe-coerce now allocates new space each callKartik K. Agaram2014-10-112-17/+56
| | | | | | | | | | | | | | | | | | | | | | (Doesn't reclaim yet. Need to build free soon. Then lexical scopes..) This commit showed the benefits of my persisting traces. I realized I needed 'sz' to handle 'deref' args. But I vaguely remembered some earlier instance when some primitive needed to recognize 'deref' at some times but not others. Was it 'sz'? Just added a trace on operands, reran all tests, grepped for deref. $ grep sz .traces -r |grep deref Nothing would fail. Ok, add 'deref' support. Boom, 3 layers of tests passed. Still concerned I'm not using traces enough. Keep vigilant. Mixing print and trace seems like a bad idea. From now on whenever I use any existing commented-out prn's I'm going to turn them into trace calls. That should put pressure on comprehending traces, and tools for doing that, like segmenting by dynamic and static layers.
* 130 - build maybe-coerce in muKartik K. Agaram2014-10-112-25/+32
| | | | | This is more likely to be right. But the limitations of symbolic locations are starting to be a drag. Time to build lexical scope.
* 129Kartik K. Agaram2014-10-101-1/+5
|
* 128Kartik K. Agaram2014-10-101-7/+3
|
* 127 - tagged values for dynamic typingKartik K. Agaram2014-10-102-0/+39
| | | | This is almost certainly wrong.
* 126Kartik K. Agaram2014-10-101-59/+59
|
* 125Kartik K. Agaram2014-10-101-0/+16
|
* 124Kartik K. Agaram2014-10-101-5/+5
|
* 123 - experiment: build the reading flow around the *test* fileKartik K. Agaram2014-10-105-305/+486
|
* 122 - make 'getc' async preparatory to making it testableKartik K. Agaram2014-10-081-1/+1
|
* 121 - finally I can alloc a 2D arrayKartik K. Agaram2014-10-072-23/+37
|
* 120 - forgot to alloc space for array lengthKartik K. Agaram2014-10-072-3/+3
|
generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2024-06-29 21:29:17 +0000