-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathgenerate.scm
235 lines (212 loc) · 8.03 KB
/
generate.scm
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
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
(load "transparent-evalo.scm")
;; Max term size is roughly 2^max-term-depth.
(define max-term-depth 2)
(define lvars
(list ;(var -100) (var -101) (var -102)
))
(define atoms
'(() #t #f s quote app var lambda list cons car cdr closure 1 x y))
(define-relation (element-from xs x)
(fresh (next rest)
(== `(,next . ,rest) xs)
(conde
((== next x))
((element-from rest x)))))
(define-relation (term m n x)
(if (<= m n)
(conde
;; Reorder clauses to control frequency of occurrence.
((== 1 n) (element-from atoms x))
((== 1 n) (element-from lvars x)) ;; Comment this out to disable vars.
((fresh (a d)
(== `(,a . ,d) x)
(term 1 (- n 1) a)
(term 1 (- n 1) d)))
((fresh (a d)
(== `(,a . ,d) x)
(term 1 (- n 1) d)
(term 2 (- n 1) a)))
((term m (- n 1) x)) ;; Remove this clause to enable extreme bushiness.
)
fail))
(define-relation (list-of domain xs)
(conde
((== '() xs))
((fresh (a d)
(== `(,a . ,d) xs)
(domain a)
(list-of domain d)))))
(define (term-list n xs) (list-of (lambda (x) (term 1 n x)) xs))
(define (vref x) (list-of (lambda (x) (== 's x)) x))
(define-relation (example-lookupo x)
(fresh (index env value)
(== `(lookupo ,index ,env ,value) x)
(vref index)
(term-list max-term-depth env)
(term 1 max-term-depth value)))
(define-relation (example-eval-expo x)
(fresh (expr env value)
(== `(eval-expo ,expr ,env ,value) x)
(term 1 max-term-depth expr)
(term-list max-term-depth env)
(term 1 max-term-depth value)))
(define-relation (example-eval-listo x)
(fresh (e* env value)
(== `(eval-listo ,e* ,env ,value) x)
(term-list max-term-depth e*)
(term-list max-term-depth env)
(term 1 max-term-depth value)))
(define-relation (example-== x)
(conde
((fresh (a d)
(== `(== ,a ,d) x)
(term 1 max-term-depth a)
(term 1 max-term-depth d)))
((fresh (a d)
(== `(== ,a ,d) x)
(term 1 max-term-depth d)
(term 2 max-term-depth a)))))
(define (examples count generate)
(define (test example)
(eval (cons (car example) (map (lambda (x) `(quote ,x)) (cdr example)))))
(define inputs (map car (run count (x) (generate x))))
(map
(lambda (i) `(,(if (null? (run 1 (q) (test i))) 0 1) ,i))
inputs))
;; Lazy example streaming
(define examples-current '())
(define (examples-start generate)
(set! examples-current (query (i) (generate i))))
(define (examples-next k)
(define (test example)
(eval (cons (car example) (map (lambda (x) `(quote ,x)) (cdr example)))))
(and (not (null? examples-current))
(let ((next (stream-next examples-current)))
(and (pair? next)
(set! examples-current (cdr next))
(let ((input (car (walk* (car next) var-initial))))
(k `(,(if (null? (run 1 (q) (test input))) 0 1) ,input)))
#t))))
;; Stream unification examples
(examples-start example-==)
(define (print-reified x) (printf "~s\n" (reify 0 state-empty x)))
(define (print-==-as-branch x)
(define branch-var (var -200))
(when (= 0 (car x))
(let ((a (cadr (cadr x)))
(c (caddr (cadr x))))
(print-reified
`(conj (== ,branch-var ,a)
(disj (== ,branch-var ,a) (== ,branch-var ,c)))))))
(define (print-==-as-branch2 x)
(define branch-var1 (var -200))
(define branch-var2 (var -201))
(when (= 0 (car x))
(let ((a (cadr (cadr x)))
(c (caddr (cadr x))))
(print-reified
`(conj (== (,branch-var1 . ,a) (,branch-var2 . ,branch-var2))
(disj (== ,branch-var2 ,a) (== ,branch-var1 ,c)))))))
(define (print-==-as-branch3-left x)
(define branch-var1 (var -200))
(define branch-var2 (var -201))
(define branch-var3 (var -202))
(when (= 0 (car x))
(let ((a (cadr (cadr x)))
(c (caddr (cadr x))))
;; left (== var1 var3)
(print-reified
`(conj (== (,branch-var1 . (,a . ,c))
(,branch-var3 . (,branch-var1 . ,branch-var2)))
(disj (== ,branch-var3 ,a) (== ,branch-var1 ,c))))
;; left (== var1 var3)
(print-reified
`(conj (== (,branch-var1 . (,a . ,c))
(,branch-var3 ,branch-var2 . (,branch-var2 . ,branch-var1)))
(disj (== ,branch-var3 ,c) (== ,branch-var1 ,a))))
;; left (== var1 var3)
(print-reified
`(conj (== (,branch-var1 . (,a . ,c))
(,branch-var3 . (,branch-var1 . ,branch-var2)))
(disj (== ,branch-var1 ,a) (== ,branch-var3 ,c))))
;; left (== var1 var3)
(print-reified
`(conj (== (,branch-var1 . (,a . ,c))
(,branch-var3 ,branch-var2 . (,branch-var2 . ,branch-var1)))
(disj (== ,branch-var1 ,c) (== ,branch-var3 ,a))))
;; left (var3 is fresh)
(print-reified
`(conj (== (,branch-var1 . (,a . ,c))
(,branch-var1 . (,branch-var1 . ,branch-var2)))
(disj (== ,branch-var3 ,c) (== ,branch-var1 ,c))))
;; left (var3 is fresh)
(print-reified
`(conj (== (,branch-var1 . (,a . ,c))
(,branch-var1 . (,branch-var1 . ,branch-var2)))
(disj (== ,branch-var3 ,a) (== ,branch-var2 ,a))))
;; left (var3 is fresh)
(print-reified
`(conj (== (,branch-var1 . (,a . ,c))
(,branch-var1 . (,branch-var1 . ,branch-var2)))
(disj (== ,branch-var1 ,branch-var3) (== ,branch-var2 ,branch-var1))))
;; left (== var3 var1)
(print-reified
`(conj (== (,branch-var1 . (,a . ,c))
(,branch-var3 . (,branch-var1 . ,branch-var2)))
(disj (== ,branch-var2 ,branch-var3) (== ,branch-var3 ,branch-var1))))
)))
(define (print-==-as-branch3-right x)
(define branch-var1 (var -200))
(define branch-var2 (var -201))
(define branch-var3 (var -202))
(when (= 0 (car x))
(let ((a (cadr (cadr x)))
(c (caddr (cadr x))))
;; right (== var1 var3)
(print-reified
`(conj (== (,branch-var1 . (,a . ,c))
(,branch-var3 ,branch-var2 . (,branch-var2 . ,branch-var1)))
(disj (== ,branch-var3 ,a) (== ,branch-var1 ,c))))
;; right (== var1 var3)
(print-reified
`(conj (== (,branch-var1 . (,a . ,c))
(,branch-var3 . (,branch-var1 . ,branch-var2)))
(disj (== ,branch-var3 ,c) (== ,branch-var1 ,a))))
;; right (== var1 var3)
(print-reified
`(conj (== (,branch-var1 . (,a . ,c))
(,branch-var3 ,branch-var2 . (,branch-var2 . ,branch-var1)))
(disj (== ,branch-var1 ,a) (== ,branch-var3 ,c))))
;; right (== var1 var3)
(print-reified
`(conj (== (,branch-var1 . (,a . ,c))
(,branch-var3 . (,branch-var1 . ,branch-var2)))
(disj (== ,branch-var1 ,c) (== ,branch-var3 ,a))))
;; right (var3 is fresh)
(print-reified
`(conj (== (,branch-var1 . (,a . ,c))
(,branch-var1 . (,branch-var1 . ,branch-var2)))
(disj (== ,branch-var1 ,c) (== ,branch-var3 ,c))))
;; right (var3 is fresh)
(print-reified
`(conj (== (,branch-var1 . (,a . ,c))
(,branch-var1 . (,branch-var1 . ,branch-var2)))
(disj (== ,branch-var2 ,a) (== ,branch-var3 ,a))))
;; right (var3 is fresh)
(print-reified
`(conj (== (,branch-var1 . (,a . ,c))
(,branch-var1 . (,branch-var1 . ,branch-var2)))
(disj (== ,branch-var1 ,branch-var2) (== ,branch-var3 ,branch-var1))))
;; right (== var3 var2)
(print-reified
`(conj (== (,branch-var2 . (,a . ,c))
(,branch-var3 . (,branch-var1 . ,branch-var2)))
(disj (== ,branch-var2 ,branch-var3) (== ,branch-var3 ,branch-var1))))
)))
;; Optionally set n to the number of desired examples.
(let loop ((n #f))
(if (and n (= 0 n))
#f
(begin
(and (examples-next print-==-as-branch3-left)
(loop (and n (- n 1)))))))