- Portland, OR
- https://danilafe.com
- Joined on
2017-09-08
Block a user
fc0ff8a586
Update flake.lock with new nixpkgs etc.
355dc7cf9d
Update to proper version of nix.package
1df315612a
Update "typesafe interpreter" article to new math delimiters
15beddf96b
Update btree article with new math delimiters
20d8b18a9b
Update 'stack language recursion' article to new math delimiters
53ff0c39e4
Update "search as polynomial" article to new math delimiters
357a3bef09
Update the modulo patterns article to use new delimiters
6179c86919
Show the basic Nat lattice.
a20fe07a56
Move original 'monotone function' text into new post and heavily rework it
2b5dcf12d7
Rename the SPA intro to have a specific name
5873c1ca96
Write a high-level introduction for the SPA series
7d2928ed81
Prove that the sign analysis is correct
5f946de5e8
Remove last remaining assumption for correctness
04bafb2d55
Prove that the inputs to wrap are empty
e0248397b7
Prove that predecessors imply edges
41ada43047
Move predecessor code into Graphs
a081edb881
Add a proof about filter's distributivity
3d2a507f2f
Almost prove correctness
82027ecd04
Move predecessor computation into Graphs
734e82ff6d
Wrap generated graphs to ensure entry and exit nodes have no extra edges
69d1ecebae
Prove that the bottom map's valyes are all bottoms
b78cb91f2a
Strengthen lemma about IterProd bottom to definition equality
f0b0d51b48
Add unproven lemma about fold implication
8ff88f9f9e
Move helper code into separate function
c1581075d3
Add more test programs
838aaf9c58
Start end-to-end proof of correctness
4ac9dffa9b
Prove that the var->lattice maps respect equality
3f5551d70c
Add a lemma about the effect of joinAll
5837fdf19b
Prove that 'updateAll' has preservation
4350919871
Add proof about setVariablesForState
7fe46b014c
Slightly simplify evaluation code
3859826293
Define interpretation of the sign lattice
be50c76cb1
Add more higher-order primitives
112a5087ef
Tentative start on proving correctness
ccb7abc501
Remove unused code from Utils
91b5d108f6
Simplify proofs about 'loop' using concatenation lemma
c574ca9c56
Prove that graphs build by buildCfg are sufficient
bbfba34e05
Prove another (simple) case
aec15573fc
Add properties of end-to-end traces on loops
b4d395767d
Simplify operations used for constructing graphs
07550bc214
Prove 'sufficiency' for if-else.
9366ec4a97
Allow promoting end-to-end traces too
0fb884eb07
Use implicit arguments for more things
6b44ac1feb
Make graph arguments implicit where possible
69a4e8eb5c
Add some helpers and rewrite code
4fee16413a
Define end-to-end path concatenation and prove one more case
316e56f2bc
Dip toes into creating end-to-end traces
ab40a27e78
Formulate correctness of buildCfg using end-to-end traces
f555947184
Promote traces through loop