about summary refs log tree commit diff stats
diff options
context:
space:
mode:
authorKartik Agaram <vc@akkartik.com>2019-02-18 20:31:44 -0800
committerKartik Agaram <vc@akkartik.com>2019-02-18 20:31:44 -0800
commit6607a30415e2bede27c43b57ce3c5cbc42278fa9 (patch)
treefd82309348521bdd4e09f026b52fe73d27333953
parentdfbc5a6c4bf9153e550c5a72dda2b1749de589f3 (diff)
downloadmu-6607a30415e2bede27c43b57ce3c5cbc42278fa9.tar.gz
4980
-rw-r--r--tangle/Readme.md16
1 files changed, 8 insertions, 8 deletions
diff --git a/tangle/Readme.md b/tangle/Readme.md
index 863965bf..be61d40e 100644
--- a/tangle/Readme.md
+++ b/tangle/Readme.md
@@ -1,9 +1,9 @@
 [Literate Programming](https://en.wikipedia.org/wiki/Literate_programming)
 tool to convert Mu's layers into compilable form.
 
-Mu's tangling differ from Knuth's classic implementation. The classical
-approach starts out with labeled subsystems that are initially empty, and adds
-code to them using two major directives:
+Mu's tangling directives differ from Knuth's classic implementation. The
+classical approach starts out with labeled subsystems that are initially
+empty, and adds code to them using two major directives:
 
 ```
 <name> ≡
@@ -15,14 +15,14 @@ code to them using two major directives:
 <code>
 ```
 
-(`<code>` can span multiple lines.)
+_(`<code>` can span multiple lines.)_
 
 This approach is best suited for top-down exposition.
 
 On the other hand, Mu's tangling directives are better suited for a cleaned-up
-history of a codebase. They can tell a story of a program over multiple
-versions, within each version keeping all the code related to each new
-feature close together.
+history of a codebase. Subsystems start out with a simple skeleton of the core
+of the program. Later versions then tell a story of the evolution of the
+program, with each version colocating all the code related to new features.
 
 Read more:
 * http://akkartik.name/post/wart-layers
@@ -70,7 +70,7 @@ Delete a block of code starting with a given header and surrounded by `{` and
 :(delete{} <header>)
 ```
 
-_(Caveat: doesn't support C's `do`..`while` loops.)_
+_(Caveat: doesn't directly support C's `do`..`while` loops.)_
 
 Replace a specific line with new code:
 
24'>24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153