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
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
|
use crate::ast::*;
use tracing::instrument;
use derive_more::Display;
use std::collections::HashMap;
use std::fmt;
#[derive(Display)]
pub enum CheckerError {
#[display("Unbound: {_0}")]
Unbound(String),
#[display("Rebinding: {_0}")]
Rebinding(String),
#[display("The following functionality is unimplemented: {_0}")]
Unimplemented(String),
#[display("Element {value} claimed to belong to {claimed} but actually belongs to {real}")]
WrongSetForElement {
value: ElementValue,
claimed: Set,
real: Set,
},
#[display("Element {element} does belong to set {claimed}: {reason}")]
ElementDoesNotBelong {
element: Element,
claimed: Set,
reason: String,
},
#[display("Case analysis {_0} does not have consistent set for scrutinee")]
IncosistentCaseScrutineeSet(Element),
#[display("Incomplete case analysis: covered [{}] but required [{}]",
found.join(", "),
required.join(", ")
)]
IncompleteCaseAnalysis {
found: Vec<String>,
required: Vec<String>,
},
}
#[derive(Display, Clone)]
#[display("{field} @ {owner}")]
pub struct Field<T: std::fmt::Display> {
pub field: T,
pub owner: T,
}
#[derive(Display, Clone)]
pub enum ElementValue {
Concrete(Element),
#[display("_ : {_0}")]
Hypothetical(Set),
}
impl From<Element> for ElementValue {
fn from(e: Element) -> ElementValue {
ElementValue::Concrete(e)
}
}
#[derive(Display, Clone)]
#[display("{value} : {set}")]
pub struct CheckedElement {
pub value: ElementValue,
pub set: Set,
}
#[derive(Default, Clone)]
pub struct CheckerState {
wf_sets: HashMap<String, Set>,
wf_elements: HashMap<String, CheckedElement>,
wf_signatures: HashMap<String, Signature>,
wf_instances: HashMap<String, Instance>,
record_fields: HashMap<String, Field<Set>>,
variant_fields: HashMap<String, Field<Set>>,
signature_fields: HashMap<String, Field<Signature>>,
}
impl fmt::Display for CheckerState {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
fn section<K, V>(f: &mut fmt::Formatter<'_>, name: &str, map: &HashMap<K, V>) -> fmt::Result
where
K: fmt::Display + Ord,
V: fmt::Display,
{
writeln!(f, " {name} = {{")?;
let mut entries: Vec<_> = map.iter().collect();
entries.sort_by(|a, b| a.0.cmp(b.0));
for (k, v) in entries {
writeln!(f, " {k} ~> {v},")?;
}
writeln!(f, " }},")
}
writeln!(f, "CheckState {{")?;
section(f, "sets", &self.wf_sets)?;
section(f, "elements", &self.wf_elements)?;
section(f, "record_fields", &self.record_fields)?;
section(f, "variant_fields", &self.variant_fields)?;
section(f, "signatures", &self.wf_signatures)?;
section(f, "instances", &self.wf_instances)?;
writeln!(f, " }}")?;
Ok(())
}
}
// -----------------------------------------------------------------------------
// Equality
// The invariant we're maintaining is that everything is fully evaluated before
// we commit it to be stored in the state. Because of our invariant we don't
// actually need to do anything non-trivial here.
pub trait DecideEquality<T> {
fn equal(&self, thing_a: &T, thing_b: &T) -> bool;
}
impl DecideEquality<Set> for CheckerState {
#[instrument(skip(self), level = "debug", fields(%set_a, %set_b))]
fn equal(&self, set_a: &Set, set_b: &Set) -> bool {
set_a == set_b
}
}
impl DecideEquality<Signature> for CheckerState {
#[instrument(skip(self), level = "debug", fields(%signature_a, %signature_b))]
fn equal(&self, signature_a: &Signature, signature_b: &Signature) -> bool {
signature_a == signature_b
}
}
impl CheckerState {
#[instrument(skip(self), level = "debug", fields(%name, %field, %belongs_to))]
fn assert_correct_owner<T>(
&self,
name: &String,
field: &Field<T>,
belongs_to: &T,
) -> Result<(), CheckerError>
where
Self: DecideEquality<T>,
T: std::fmt::Display,
{
if !self.equal(&field.owner, belongs_to) {
Err(CheckerError::Rebinding(name.clone()))
} else {
Ok(())
}
}
}
// -----------------------------------------------------------------------------
// Sets
impl CheckerState {
fn assert_unbound_set(&self, name: &String) -> Result<(), CheckerError> {
if self.wf_sets.contains_key(name) {
Err(CheckerError::Rebinding(name.clone()))
} else {
Ok(())
}
}
fn assert_unbound_element(&self, name: &String) -> Result<(), CheckerError> {
if self.wf_elements.contains_key(name) {
Err(CheckerError::Rebinding(name.clone()))
} else {
Ok(())
}
}
#[instrument(skip(self), level = "debug", fields(%name, %field_set, %owner_set))]
fn add_record_field(
&mut self,
name: &String,
field_set: &Set,
owner_set: &Set,
) -> Result<(), CheckerError> {
if let Some(set_ref) = self.record_fields.get(name) {
self.assert_correct_owner(name, set_ref, owner_set)?;
};
self.record_fields.insert(
name.clone(),
Field {
field: field_set.clone(),
owner: owner_set.clone(),
},
);
Ok(())
}
#[instrument(skip(self), level = "debug", fields(%name, %field_set, %owner_set))]
fn add_variant_field(
&mut self,
name: &String,
field_set: &Set,
owner_set: &Set,
) -> Result<(), CheckerError> {
if let Some(set_ref) = self.variant_fields.get(name) {
self.assert_correct_owner(name, set_ref, owner_set)?;
};
self.variant_fields.insert(
name.clone(),
Field {
field: field_set.clone(),
owner: owner_set.clone(),
},
);
Ok(())
}
#[instrument(skip(self), level = "debug", fields(%name, %set))]
pub fn add_set(&mut self, name: &String, set: Set) -> Result<(), CheckerError> {
self.assert_unbound_set(name)?;
match &set {
Set::Record(fields) => {
for RecordField {
name: rfn,
set: field_set,
} in fields
{
self.add_record_field(rfn, field_set, &set)?;
}
}
Set::Variant(fields) => {
for VariantField {
name: vfn,
set: field_set,
} in fields
{
self.add_variant_field(vfn, field_set, &set)?;
}
}
_ => (),
};
self.wf_sets.insert(name.clone(), set);
Ok(())
}
#[instrument(skip(self), level = "debug", fields(%name, %element, %set))]
pub fn add_element(
&mut self,
name: String,
element: ElementValue,
set: Set,
) -> Result<(), CheckerError> {
self.assert_unbound_element(&name)?;
self.wf_elements.insert(
name,
CheckedElement {
value: element,
set,
},
);
Ok(())
}
pub fn lookup_set(&self, name: &String) -> Result<&Set, CheckerError> {
self.wf_sets
.get(name)
.map_or(Err(CheckerError::Unbound(name.clone())), Ok)
}
pub fn lookup_element(&self, name: &String) -> Result<&CheckedElement, CheckerError> {
self.wf_elements
.get(name)
.map_or(Err(CheckerError::Unbound(name.clone())), Ok)
}
pub fn lookup_record_field(&self, name: &String) -> Result<&Field<Set>, CheckerError> {
self.record_fields
.get(name)
.map_or(Err(CheckerError::Unbound(name.clone())), Ok)
}
pub fn lookup_variant_field(&self, name: &String) -> Result<&Field<Set>, CheckerError> {
self.variant_fields
.get(name)
.map_or(Err(CheckerError::Unbound(name.clone())), Ok)
}
}
// -----------------------------------------------------------------------------
// Signatures
impl CheckerState {
fn assert_unbound_signature(&self, name: &String) -> Result<(), CheckerError> {
if self.wf_signatures.contains_key(name) {
Err(CheckerError::Rebinding(name.clone()))
} else {
Ok(())
}
}
// fn assert_unbound_instance(&self, name: &String) -> Result<(), CheckerError> {
// if self.wf_instances.contains_key(name) {
// Err(CheckerError::Rebinding(name.clone()))
// } else {
// Ok(())
// }
// }
#[instrument(skip(self), level = "debug", fields(%name, %field_signature, %owner_signature))]
fn add_signature_field(
&mut self,
name: &String,
field_signature: &Signature,
owner_signature: &Signature,
) -> Result<(), CheckerError> {
if let Some(signature_ref) = self.signature_fields.get(name) {
self.assert_correct_owner(name, signature_ref, owner_signature)?;
};
self.signature_fields.insert(
name.clone(),
Field {
field: field_signature.clone(),
owner: owner_signature.clone(),
},
);
Ok(())
}
#[instrument(skip(self), level = "debug", fields(%name, %signature))]
pub fn add_signature(
&mut self,
name: &String,
signature: Signature,
) -> Result<(), CheckerError> {
self.assert_unbound_signature(name)?;
match &signature {
Signature::Theory(fields) => {
for SigField {
name: field_name,
signature: field_sig,
} in fields
{
self.add_signature_field(field_name, field_sig, &signature)?;
}
}
// TODO: is there more?
_ => (),
};
self.wf_signatures.insert(name.clone(), signature);
Ok(())
}
}
|