summaryrefslogtreecommitdiff
path: root/chain/src/plan.org
diff options
context:
space:
mode:
authorJSDurand <mmemmew@gmail.com>2023-01-20 13:48:26 +0800
committerJSDurand <mmemmew@gmail.com>2023-01-20 13:48:26 +0800
commit18d7955b7d84c00467ede38baae53f4ce1fb6908 (patch)
tree97d0746b82816a21d980636e50f8cdbeb804b518 /chain/src/plan.org
parent8f8d3d1a3c276be4be2e5d2e767ada564c47279a (diff)
chain: a prototype is added.
I have an ostensibly working prototype now. Further tests are needed to make sure that the algorithm meets the time complexity requirement, though.
Diffstat (limited to 'chain/src/plan.org')
-rw-r--r--chain/src/plan.org10
1 files changed, 6 insertions, 4 deletions
diff --git a/chain/src/plan.org b/chain/src/plan.org
index 84192f0..c2a9037 100644
--- a/chain/src/plan.org
+++ b/chain/src/plan.org
@@ -88,13 +88,15 @@
+ [X] Define a trait with the expected behaviours.
+ [X] Implement them as parents-knowing graphs.
+ [X] Test
-- [-] Implement languages. [1/4]
+- [-] Implement languages. [4/6]
+ [X] First define a trait with the expected behaviours.
- + [ ] Then implement them as doubly labelled graphs.
- + [ ] Then implement finding derivatives by use of the chain rule.
- + [ ] Each edge in the chain-rule machine needs to be labelled also
+ + [X] Then implement them as doubly labelled graphs.
+ + [X] Each edge in the chain-rule machine needs to be labelled also
with a position in the forest. This perfectly solves the problem
of those "plugs"!
+ + [X] Then implement finding derivatives by use of the chain rule.
+ + [ ] Handle Forests
+ + [-] Tests
- [ ] Implement semiring. [0/5]
+ [ ] Define the trait.
+ [ ] Implement the boolean semiring.