Commit Graph

985 Commits

Author SHA1 Message Date
Nathan Braswell
dd28087818 Some more updates based on feedback 2022-02-02 01:41:19 -05:00
Nathan Braswell
6f3d8d514b Added quote example 2022-02-01 00:50:36 -05:00
Nathan Braswell
c05a7bd2d5 More slides work, expanding examples, proof reading, adding explanation 2022-01-31 23:42:27 -05:00
Nathan Braswell
2f395926d3 Fix 2022-01-31 18:35:14 -05:00
Nathan Braswell
3086ad4b01 First draft of presentation 2022-01-31 00:08:37 -05:00
Nathan Braswell
df76ae51e2 Start to fill in Abstract/Introduction/Related Work/Issues/Solution 2022-01-30 20:20:16 -05:00
Nathan Braswell
7f220c97b8 Finally make a clean sweep and delete / organize old files. Add skeleton for LaTeX formal writeup in doc/ and change license (since this is all new code from the past few years) to BSD-2-Clause-Patent 2022-01-30 16:57:21 -05:00
Nathan Braswell
315ae20698 Clean up strip, have default memory allocation scale based on constants, added more until the next bug found, map seems not to be partially evaluating properly 2022-01-28 00:26:46 -05:00
Nathan Braswell
90750933fc Fixed the recursion! Memo has moved to just being the infinite recursion detector based on body and inner-env 2022-01-27 21:54:15 -05:00
Nathan Braswell
2746e1ca75 contains_symbols is/was exhibiting exponential behavior - probs memoizing or using needed_for_eval could fix it, but also it doesn't normally have to be called, so just doing that got us a 50x speedup or so 2022-01-26 23:43:50 -05:00
Nathan Braswell
c8df8742d1 Actualy I'm just going to disable memo except for recursion detection 2022-01-26 22:45:16 -05:00
Nathan Braswell
3748610dea Can finally compile let! The memoization of partial_eval was allowing re-introduction of fake envs somehow. Temporarily disabled, also added a bunch of debugging aids like str_strip only printing envs in full the first time, need_value being passed through compile to fail faster, etc 2022-01-26 22:41:29 -05:00
Nathan Braswell
9bc658a1a4 Ah, found additional infinate recursion. In the process of fixing the second, trickier one, caused by compile & partial eval together. Should be fixed? but there's a nil coming out somewhere 2022-01-26 01:55:38 -05:00
Nathan Braswell
d4752eddb4 Fixed the bug! ctx has env in it, and was being returned upwards, messing up the environment of subsequently compiled things. The key is to make sure things that modify the environment (compiling functions) return the env it was passed in the ctx 2022-01-25 16:51:06 -05:00
Nathan Braswell
77c7a05a28 Hopefully fixed the new exponential behavior by piggybacking on a now more accurate needed-for-eval tracking (that hopefully didn't introduce it's own exponential behavior but might have), and other fixes. We still have the same weird problem though 2022-01-23 14:16:07 -05:00
Nathan Braswell
94e2d62a10 Ok, finished fixing check_for_env_id_in_result, now works up to before. Weirdly, we're now just back to the previous error, and I think I might have reintroduced exponential behavior with the env_id searching 2022-01-22 00:56:02 -05:00
Nathan Braswell
99926cdb7c check_for_env_id_in_result fixed, I had accidentally left it unimplemented. Bug with envs escaping when they weren't real fixed, and most everything works, but compiling lapply fails now 2022-01-22 00:19:10 -05:00
Nathan Braswell
8a1e92cd70 Make partial_eval_helper fail gracefully as well, as per previous explanation of why it's required (called from compiler to opt eval side of maybe only vau calls). Gets farther than before, but has a new error now for compiling Y that I don't have time to debug tonight 2022-01-20 00:32:15 -05:00
Nathan Braswell
6602ff3151 The refactor has either caught up, or is close, and is much faster.
Need to make partial_eval_helper able to fail though, so that it can fail in the now fallible compiler.

Squashed commit of the following:

commit 283150d1e19cf9f74bc32e9c554f5e041d53582d
Author: Nathan Braswell <miloignis@gmail.com>
Date:   Tue Jan 18 00:14:51 2022 -0500

    Another bugfix, I think now we're truely running into the partial-eval needs to be able to fail part

commit c62c228a1e89e7922850d2070bc046e5f80af5a5
Author: Nathan Braswell <miloignis@gmail.com>
Date:   Mon Jan 17 23:34:19 2022 -0500

    Fixed needed check, added note on needing to support failing partial eval

commit d480e486210dd5c7c4842e3a3d3e447dc7a5274e
Author: Nathan Braswell <miloignis@gmail.com>
Date:   Mon Jan 17 22:14:58 2022 -0500

    Fixed compilation bugs, added debugging prints to running.

commit fc4dc4d3170bf1ceb4cd934cff54dd9ce6c8713a
Author: Nathan Braswell <miloignis@gmail.com>
Date:   Mon Jan 17 17:28:29 2022 -0500

    The unique id / ctx refactor is starting to work, with all basic test cases compiling & partial evaling, but mis-compile bugs remaining
2022-01-18 00:36:42 -05:00
Nathan Braswell
49c5e9da2f Added the lazy eval function thing.
Keeping it off is 5.3s
Turning it on is 6.8s
Forcing it on always, which I thought would cause compilation problems (and I guess just turns most optimization off, but does enough to remove vaus?): 2.8s
so using it the way I designed makes it worse
and using it to a degree I thought it would be buggy makes is way faster
Indeed, forcing it on all the time does cause it to error for larger cases, but it is interesting
So I'm not entirely sure where to go with that, I think smaller test cases and profiling number of calls or something is warrented
2022-01-10 01:26:56 -05:00
Nathan Braswell
74a7cb8a20 Don't repeatedly evaluate params in different cases - I thought this would be a larger optimization, but it seemed more like 1%... 2022-01-09 00:45:16 -05:00
Nathan Braswell
025b149c28 Implemented each marked node carrying the de Bruijn indicies that it needs to continue evauluating, but now it takes the exact same amount of time that it used to
And I think I've realized why - it's being too conservative about what it actually needs to be a value and includes the entire environment chain, which pretty much means anytime it would have been re-evaluated because a parent function was called or re-evaluated it will also be re-evaluated, and none of this changes anything
I think I can change it to more intelligently pull what's necessary based on what's used in the body of the function instead and get the optimization to work as I expected - fingers crossed
2022-01-09 00:17:57 -05:00
Nathan Braswell
6ef60c4cc6 I belive I fixed the bug revealed by the let definition - it was a similar thing where <comb>s were counted as values even if there were fake envs inside, and then thouse fake envs could be moved inside another env_stack and then later resolve to a wrong env, or at lest I think that's what was happening. The let test takes too long to run now - I killed it at 20 minutes and 48GB of RAM taken. Given that, it's now time to move on towards optimization 2022-01-07 22:08:29 -05:00
Nathan Braswell
b559bfdf90 Add note about compiling params meant for Vau & additional partial eval for that case to help in cases where it's legitimate. Eventually it should handle errors gracefully, but non-gracefully can be good enough for now. 2022-01-05 22:58:26 -05:00
Nathan Braswell
1aa9ca972a Fix & and error checking for compiling environments as code & value, add a todo for things deferred 2022-01-05 01:05:16 -05:00
Nathan Braswell
d1fc4e5d66 Fix another bug where things like (<comb0> <somecomb fake env>) wasn't reevaluating somecomb and fixing up the fake env on calls because comb0 has wrap level 0. In fact, it should still be partially evaluated again, just not stripped. This only comes up in slightly nontrivial examples because there's a good bit of nesting 2022-01-04 23:37:57 -05:00
Nathan Braswell
48cab3cbdf Found the partial eval bug - a comb with a non-real environment doesn't count as later? which means that array values with them get skipped and not partial evaled further, which means they don't get further refined. I need to think through exactly which definition of later? is correct, or if it should be two concepts, because one of the two uses or the definition must change. For now just commented out the array value return and has it always re-traverse 2022-01-04 01:19:41 -05:00
Nathan Braswell
6816742fd6 Parse comments 2022-01-04 00:14:26 -05:00
Nathan Braswell
d2d4b15afa Found it - print was dropping it's parameter even though the comment above it *clearly* said that it didn't 2022-01-03 22:22:34 -05:00
Nathan Braswell
321157c311 Added symbol parsing and ' syntax sugar parsing, but found a ref counting problem (unrelated to parsing, though that did expose it). Tracking down the bug now 2022-01-03 22:03:32 -05:00
Nathan Braswell
98bdf32ad8 Not a lot of error checking for mixed or confusing bases, but did add negative, hex, and binary integers 2022-01-03 19:03:36 -05:00
Nathan Braswell
cf72232282 Implement string escapes 2022-01-03 16:15:30 -05:00
Nathan Braswell
6f73be4777 Add ['open parent_fd path <comb(new_fd error_code)>] monad 2022-01-03 14:02:07 -05:00
Nathan Braswell
e633a43f2e Parsing strings, but naively without escapes yet 2022-01-03 02:17:52 -05:00
Nathan Braswell
26e9a92f74 Can parse arrays! 2022-01-03 01:44:14 -05:00
Nathan Braswell
f8d2e17c90 Started working on parser, can now parse true and false. Also, I realized that most of the array functions have to be adapted to work with strings too (idx, concat, slice - maybe len already works?) 2022-01-02 23:37:45 -05:00
Nathan Braswell
a3ee9291c6 Implement comparison operators = != < <= >= > 2022-01-02 00:16:12 -05:00
Nathan Braswell
6831e76bf3 Add bxor and bnot (rename band bor), remove and and or, add wrap, unwrap, get-text, str-to-symbol 2022-01-01 16:42:57 -05:00
Nathan Braswell
2b08daccd1 Implemented the missing array methods (and some fixes) concat, len, idx, slice 2022-01-01 15:14:47 -05:00
Nathan Braswell
c530405376 Added << and >> 2022-01-01 12:38:49 -05:00
Nathan Braswell
08e3292d92 Added all of the predicate functions 2021-12-31 14:08:29 -05:00
Nathan Braswell
f1d2e0dce2 Add rough version of log, error, str, ptr-equality-rough versions of = and !=, and actual versions for + - * / % & | 2021-12-31 01:28:31 -05:00
Nathan Braswell
ad38628915 Add inlining of cond, which sould be the only non-wrapped vau left in normal programs currently. Started implementation of = to test cond (just ptr equality for now) and it works! 2021-12-30 17:23:15 -05:00
Nathan Braswell
7b7bccb5dd Implemented unoptimized and naive version of what will become Perceus reference counting (functions hold the env till the end, and the env means everything is borrowed, so all params are dup'd into function calls etc.), along with a very unoptimzied and naive malloc&free (single singlely linked list of blocks that are wasm page sized (4k)) 2021-12-30 01:04:07 -05:00
Nathan Braswell
accad76fa9 Add place to handle (calls unreachable for now) for non wrap-1 combiners 2021-12-29 14:38:36 -05:00
Nathan Braswell
6e5a372f07 Add compilation of closures as code 2021-12-28 19:14:02 -05:00
Nathan Braswell
2318b958e8 Implemented partially variadic functions! Remaining: functions in code, refcounting, stdlib 2021-12-28 17:34:17 -05:00
Nathan Braswell
a4a033a72e Implemented function calls! 2021-12-28 14:24:54 -05:00
Nathan Braswell
78ba54879a Error checking for monads and number of parameters. Implemented fully variadic, partially variadic deserves a bit more thought to see if it can be implemented efficiently 2021-12-28 00:20:13 -05:00
Nathan Braswell
481cac5070 Add block length to memory header (joining the refcount), add read & write monand impls. Big todo: typechecks in monad impl, length checks for compiled functions, compiling calls, then all the stdlib. 2021-12-27 01:35:15 -05:00