diff --git a/trees/jdll-0001.tree b/trees/jdll-0001.tree
index 18be23c..801d41f 100644
--- a/trees/jdll-0001.tree
+++ b/trees/jdll-0001.tree
@@ -7,8 +7,8 @@ This is my personal set of notes inspired by
 [stacks](https://www.jonmsterling.com/stacks-project.xml), [evergreen
 notes](https://notes.andymatuschak.org/Evergreen_notes), and
 [zettelkasten](https://jonathanlorimer.dev/posts/smart-notes-review.html). This
-page is intended to be the primarry index and links out to other index cards
+page is intended to be the primary index and links out to other index cards
 that are concept specific.
 }
 \transclude{jdll-0002}
-
+\transclude{jdll-0004}
diff --git a/trees/jdll-0004.tree b/trees/jdll-0004.tree
new file mode 100644
index 0000000..3073fc5
--- /dev/null
+++ b/trees/jdll-0004.tree
@@ -0,0 +1,5 @@
+\title{Learning Paths}
+\author{jonathanlorimer}
+\date{2024-02-11}
+
+\transclude{jdll-0005}
diff --git a/trees/jdll-0005.tree b/trees/jdll-0005.tree
new file mode 100644
index 0000000..96fc549
--- /dev/null
+++ b/trees/jdll-0005.tree
@@ -0,0 +1,8 @@
+\title{Algorithms}
+\author{jonathanlorimer}
+\date{2024-02-11}
+
+
+\transclude{how_to_design_co_programs}
+\transclude{algorithm_design_with_haskell}
+\transclude{pearls_of_functional_algorithm_design}
diff --git a/trees/resources/algorithm_design_with_haskell.tree b/trees/resources/algorithm_design_with_haskell.tree
new file mode 100644
index 0000000..6b685dd
--- /dev/null
+++ b/trees/resources/algorithm_design_with_haskell.tree
@@ -0,0 +1,5 @@
+\title{Algorithm Design with Haskell}
+\taxon{resource}
+\meta{external}{https://www.cambridge.org/ru/universitypress/subjects/computer-science/algorithmics-complexity-computer-algebra-and-computational-g/algorithm-design-haskell?format=HB&isbn=9781108491617}
+
+\p{This book written by Jeremy Gibbons and Richard Bird looks at algorithms through the lens of structured programs.}
diff --git a/trees/resources/how_to_design_co_programs.tree b/trees/resources/how_to_design_co_programs.tree
new file mode 100644
index 0000000..ff25ad9
--- /dev/null
+++ b/trees/resources/how_to_design_co_programs.tree
@@ -0,0 +1,5 @@
+\title{How to Design Co-Programs}
+\taxon{resource}
+\meta{external}{https://www.cs.ox.ac.uk/jeremy.gibbons/publications/copro.pdf}
+
+\p{This paper briefly discusses how to design programs based on their inputs and recursive structure. However, it more deeply investigates a formula for designing programs based off their outputs and a co-recursive structure.}
diff --git a/trees/resources/pearls_of_functional_algorithm_design.tree b/trees/resources/pearls_of_functional_algorithm_design.tree
new file mode 100644
index 0000000..b7166cc
--- /dev/null
+++ b/trees/resources/pearls_of_functional_algorithm_design.tree
@@ -0,0 +1,5 @@
+\title{Pearls of Functional Algorithm Design}
+\taxon{resource}
+\meta{external}{https://www.cambridge.org/ru/universitypress/subjects/computer-science/programming-languages-and-applied-logic/pearls-functional-algorithm-design?format=HB}
+
+\p{Book on algorithm design by Richard Bird, walks through a series of algorithmic problems using equational reasoning.}