-
Notifications
You must be signed in to change notification settings - Fork 6
/
to_do.txt
181 lines (123 loc) · 3.45 KB
/
to_do.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
Organization
============
Chapter 1
----------
Introduction
Chapter 2
----------
Introduction to Core miniKanren
Techniques:
Basic Techniques
Applications:
Simple Examples
Implementations:
Core miniKanren
Optimizing walk
Chapter 3
---------
<common theme/title/intro???>
Techniques:
Deriving Bounds for Bottom Avoidance
Applications:
Pure Binary Arithmetic
Implementations:
Interleaving Search
Chapter 4
---------
<common theme/title/intro???>
Techniques:
Disequality Constraints
Applications:
Scheme-to-miniKanren Translation
Implementations:
Disequality Constraints
Chapter 5
---------
<common theme/title/intro???>
Techniques:
Nominal Logic
Removing copy-termo
Applications:
Relational Type Inferencer
alphaleanTAP
Implementations:
alphaKanren
Chapter 6
---------
<common theme/title/intro???>
Techniques:
Bottom Avoidance via Tabling
Applications:
PLT-Redex-style Reducer
Implementations:
Tabling
Chapter 7
---------
<common theme/title/intro???>
Techniques:
Expression-level Bottom Avoidance
Applications:
???
Implementations:
Ferns-based miniKanren
Chapter 8
---------
Related Work
Chapter 9
---------
Future Work
Chapter 10
---------
Conclusion
Appendices
----------
Appendix A: Familiar Helpers
Appendix B: pmatch
Appendix C: Ferns Implementation
Bibliography
What am I missing? What about a relational inferencer? Is that worth exploring, or is there too much overlap with relational type inference?
Maybe I should try a single technique, application, and implementation per chapter.
Have a goal for each day: today I'm going to work on ______.
Timeline
--------
18 W March reorg/detailed outline
19 Th
20 F <Brian's birthday>
21 Sa
22 Su
23 M [end of break--pick defense date/time; send out announcement]
24 T
25 W
26 Th <lab>
27 F <lab>
28 Sa
29 Su
30 M
31 T [must submit defense announcement no more than 30 days out!]
1 W April
2 Th <lab>
3 F <lab>
4 Sa
5 Su
6 M
7 T Complete draft due!
As of March 19, 20 days left (16 non-lab days)
create detailed timeline for April 7 deadline
reorganize diss., so that each core chapter contains techniques, aplications, and implementations; this may require some serious thinking
[consider using an organization at least partly inspired by my proposal slides]
create detailed outline for unwritten chapters/sections, down to the topic sentence of each para, and including all code
make sure conclusion, intro, thesis, etc., match updated versions in proposal and slides
see if I can salvage wording from my written proposal, slides, or the first draft of my diss.
write chapter on Scheme-to-miniKanren translation, demonstrating non-overlapping principle
opening quotes for each chapter
Make sure I include:
"A novel technique for eliminating uses of copy term/2, using nominal logic and tagging."
Add pure binary arithmetic paper to bibliography.
make sure I'm using the latest version of all software (remember that Dan wants me to use a_0 and a_1 instead of a_0 and b_0 for reified noms--must change slides)
should probably create a system to run all tests when typesetting diss.
update arithmetic chapter to use miniKanren instead of Prolog
see if I can find an application requiring ferns
find nice example application requiring tabling; perhaps reducer
clean up and write up tabling, PLT-style-reducer, complete type inferencer, and interpreter
update resume with ferns paper, once submitted to Mitch's fesc.
update/improve slides