equal
deleted
inserted
replaced
201 > might be possible, if one represents the definitions "x1 = t1 and ..." |
201 > might be possible, if one represents the definitions "x1 = t1 and ..." |
202 > using a set of pairs (or a map of names to terms) as opposed to a list |
202 > using a set of pairs (or a map of names to terms) as opposed to a list |
203 > of pairs. I think that the system should at the very least allow encoding |
203 > of pairs. I think that the system should at the very least allow encoding |
204 > this example, otherwise set-abstractions will not be very useful in |
204 > this example, otherwise set-abstractions will not be very useful in |
205 > practice. |
205 > practice. |
|
206 |
|
207 >> datatype trm = |
|
208 >> Var string |
|
209 >> | App trm trm |
|
210 >> | Lam string trm |
|
211 >> | Let "(string * trm) fset" trm |
|
212 >> Not a problem. Both finite sets and bags should be possible as |
|
213 >> constructors within the new package. |
|
214 >> Best regards and a happy new year! |
|
215 >> Andrei Popescu |
|
216 |
|
217 |
206 > |
218 > |
207 > Detailed comments |
219 > Detailed comments |
208 > |
220 > |
209 > [Written while I was reading, so sometimes I ask a question whose |
221 > [Written while I was reading, so sometimes I ask a question whose |
210 > answer comes |
222 > answer comes |