tla-ts 0.0.3-dev.31e0776 → 0.0.3-dev.3504663
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +50 -22
- package/dist/index.d.ts +50 -22
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +2 -2
- package/dist/parallel.cjs +1 -1
- package/dist/parallel.js +2 -2
- package/dist/run-cli.cjs +14 -12
- package/dist/run-cli.js +22 -20
- package/dist/transfer.cjs +38 -21
- package/dist/transfer.js +38 -21
- package/package.json +1 -1
- package/src/ast.ts +11 -1
- package/src/builtins.ts +9 -3
- package/src/check.ts +357 -79
- package/src/codegen.ts +6 -3
- package/src/config.ts +224 -170
- package/src/environment.ts +90 -40
- package/src/errors.ts +89 -1
- package/src/evaluate.ts +182 -26
- package/src/exit-codes.ts +22 -3
- package/src/fingerprints.ts +2 -1
- package/src/instances.ts +1 -1
- package/src/levels.ts +173 -37
- package/src/live-check.ts +132 -70
- package/src/liveness.ts +117 -22
- package/src/parallel-worker.ts +2 -2
- package/src/parallel.ts +2 -2
- package/src/parser.ts +71 -19
- package/src/resolve.ts +429 -52
- package/src/run-cli.ts +59 -11
- package/src/sany-lexer.ts +615 -0
- package/src/sany-parse-error.ts +3143 -0
- package/src/spec-description.ts +1 -2
- package/src/standard-modules.ts +54 -45
- package/src/subexpressions.ts +25 -13
- package/src/substitution-levels.ts +38 -17
- package/src/successors.ts +121 -34
- package/src/symmetry.ts +16 -6
- package/src/tableau.ts +51 -24
- package/src/tlc-module.ts +6 -6
- package/src/tlc-modules.ts +4 -0
- package/src/tlc-order.ts +8 -4
- package/src/tlc-random.ts +9 -6
- package/src/tlc-summary.ts +20 -5
- package/src/value-sources.ts +29 -0
- package/src/values.ts +222 -57
package/src/values.ts
CHANGED
|
@@ -1,5 +1,6 @@
|
|
|
1
1
|
import { TlaEvaluationError, TlaModuleError } from "./errors";
|
|
2
2
|
import { prettyPrint } from "./pretty-print";
|
|
3
|
+
import { valueSources, withSource } from "./value-sources";
|
|
3
4
|
|
|
4
5
|
export interface ModelValue {
|
|
5
6
|
kind: "ModelValue";
|
|
@@ -137,6 +138,13 @@ export const isSetValue = (value: Value) =>
|
|
|
137
138
|
value.kind !== "Function" &&
|
|
138
139
|
value.kind !== "LazyFunction";
|
|
139
140
|
|
|
141
|
+
export type ReducibleSet = SetValue | MixedSetValue | IntervalValue;
|
|
142
|
+
|
|
143
|
+
// TLC reduces a set enumeration or an interval eagerly, and keeps every other set lazy.
|
|
144
|
+
export const isReducible = (value: Value): value is ReducibleSet =>
|
|
145
|
+
typeof value === "object" &&
|
|
146
|
+
(value.kind === "Set" || value.kind === "MixedSet" || value.kind === "Interval");
|
|
147
|
+
|
|
140
148
|
export const isFunctionValue = (value: Value): value is FunctionValue | LazyFunctionValue =>
|
|
141
149
|
typeof value === "object" && (value.kind === "Function" || value.kind === "LazyFunction");
|
|
142
150
|
|
|
@@ -371,7 +379,7 @@ export const compareValues = (left: Value, right: Value): number => {
|
|
|
371
379
|
`Attempted to compare ${describeKind(left)} ${formatValue(left)} with ${describeKind(right)} ${formatValue(right)}`,
|
|
372
380
|
);
|
|
373
381
|
}
|
|
374
|
-
if (isLeftSet) return compareSets(toFiniteSet(left),
|
|
382
|
+
if (isLeftSet) return compareSets(toFiniteSet(left), toComparedSet(right));
|
|
375
383
|
return compareFunctions(toFiniteFunction(left), toFiniteFunction(right));
|
|
376
384
|
}
|
|
377
385
|
if (typeof left === "number" && typeof right === "number") return left - right;
|
|
@@ -726,16 +734,17 @@ const compareSetLikeTlc = (left: ObjectValue, right: Value): number => {
|
|
|
726
734
|
);
|
|
727
735
|
};
|
|
728
736
|
|
|
729
|
-
const compareLikeTlc = (left: Value, right: Value): number =>
|
|
730
|
-
|
|
731
|
-
if (typeof
|
|
732
|
-
|
|
733
|
-
|
|
734
|
-
|
|
735
|
-
|
|
736
|
-
|
|
737
|
-
|
|
738
|
-
|
|
737
|
+
const compareLikeTlc = (left: Value, right: Value): number =>
|
|
738
|
+
withSource(left, () => {
|
|
739
|
+
if (typeof left !== "object") {
|
|
740
|
+
if (typeof right === typeof left) return compareValues(left, right);
|
|
741
|
+
if (isModelValue(right)) return compareModelValueWith(right, left);
|
|
742
|
+
throw new TlaEvaluationError(describeScalarMismatch(left, right, false));
|
|
743
|
+
}
|
|
744
|
+
if (left.kind === "ModelValue") return compareModelValue(left, right);
|
|
745
|
+
if (isFunctionValue(left)) return compareFunctionLikeTlc(left, right);
|
|
746
|
+
return compareSetLikeTlc(left, right);
|
|
747
|
+
});
|
|
739
748
|
|
|
740
749
|
const equalsElementsLikeTlc = (left: Value[], right: Value[]) =>
|
|
741
750
|
left.every((element, index) => equalsLikeTlc(element, right[index]));
|
|
@@ -823,16 +832,17 @@ const equalsSetLikeTlc = (left: ObjectValue, right: Value): boolean => {
|
|
|
823
832
|
);
|
|
824
833
|
};
|
|
825
834
|
|
|
826
|
-
const equalsLikeTlc = (left: Value, right: Value): boolean =>
|
|
827
|
-
|
|
828
|
-
if (typeof
|
|
829
|
-
|
|
830
|
-
|
|
831
|
-
|
|
832
|
-
|
|
833
|
-
|
|
834
|
-
|
|
835
|
-
|
|
835
|
+
const equalsLikeTlc = (left: Value, right: Value): boolean =>
|
|
836
|
+
withSource(left, () => {
|
|
837
|
+
if (typeof left !== "object") {
|
|
838
|
+
if (typeof right === typeof left) return left === right;
|
|
839
|
+
if (isModelValue(right)) return equalsModelValueWith(right, left);
|
|
840
|
+
throw new TlaEvaluationError(describeScalarMismatch(left, right, true));
|
|
841
|
+
}
|
|
842
|
+
if (left.kind === "ModelValue") return equalsModelValue(left, right);
|
|
843
|
+
if (isFunctionValue(left)) return equalsFunctionLikeTlc(left, right);
|
|
844
|
+
return equalsSetLikeTlc(left, right);
|
|
845
|
+
});
|
|
836
846
|
|
|
837
847
|
// TLC's ValueVec.sort, which inserts each element into the sorted prefix by binary search.
|
|
838
848
|
const sortLikeTlc = (elements: Value[]) => {
|
|
@@ -864,9 +874,11 @@ export const isEqualLikeTlc = (left: Value, right: Value) => {
|
|
|
864
874
|
}
|
|
865
875
|
};
|
|
866
876
|
|
|
877
|
+
// TLC sorts a set by comparing each element with the ones before it, so the later element converts
|
|
878
|
+
// a lazy set it compares and caches it.
|
|
867
879
|
const isStrictlySorted = (elements: Value[]) => {
|
|
868
880
|
for (let index = 1; index < elements.length; index++) {
|
|
869
|
-
if (compareValues(elements[index
|
|
881
|
+
if (compareValues(elements[index], elements[index - 1]) <= 0) return false;
|
|
870
882
|
}
|
|
871
883
|
return true;
|
|
872
884
|
};
|
|
@@ -1187,6 +1199,41 @@ const advanceCombination = (indices: number[], length: number) => {
|
|
|
1187
1199
|
return false;
|
|
1188
1200
|
};
|
|
1189
1201
|
|
|
1202
|
+
// TLC enumerates SUBSET S lazily, by size and then in the order of S, so a quantifier that finds
|
|
1203
|
+
// its witness early never builds the rest. For a power set too large to build, the elements are
|
|
1204
|
+
// computed in that order as a loop reads them.
|
|
1205
|
+
export const getLazySubsets = (value: Value): Value[] | undefined => {
|
|
1206
|
+
if (typeof value !== "object" || value.kind !== "Subset" || isOverriddenSet(value.base)) {
|
|
1207
|
+
return undefined;
|
|
1208
|
+
}
|
|
1209
|
+
const base = toFiniteSet(value.base).elements;
|
|
1210
|
+
if (base.length <= MAXIMUM_ENUMERATED_SUBSET_BASE) return undefined;
|
|
1211
|
+
const cursor = { index: -1, indices: [0] };
|
|
1212
|
+
const getSubset = (index: number) => {
|
|
1213
|
+
if (index <= cursor.index) cursor.index = -1;
|
|
1214
|
+
while (cursor.index < index) {
|
|
1215
|
+
if (cursor.index === -1) cursor.indices = [];
|
|
1216
|
+
else if (!advanceCombination(cursor.indices, base.length)) {
|
|
1217
|
+
cursor.indices = Array.from({ length: cursor.indices.length + 1 }, (_, item) => item);
|
|
1218
|
+
}
|
|
1219
|
+
cursor.index++;
|
|
1220
|
+
}
|
|
1221
|
+
return createSortedSet(cursor.indices.map((item) => base[item]));
|
|
1222
|
+
};
|
|
1223
|
+
const length = 2 ** base.length;
|
|
1224
|
+
const isIndex = (property: string | symbol) =>
|
|
1225
|
+
typeof property === "string" && /^\d+$/.test(property) && Number(property) < length;
|
|
1226
|
+
return new Proxy<Value[]>([], {
|
|
1227
|
+
get: (target, property, receiver) => {
|
|
1228
|
+
if (property === "length") return length;
|
|
1229
|
+
return isIndex(property)
|
|
1230
|
+
? getSubset(Number(property))
|
|
1231
|
+
: Reflect.get(target, property, receiver);
|
|
1232
|
+
},
|
|
1233
|
+
has: (target, property) => isIndex(property) || Reflect.has(target, property),
|
|
1234
|
+
});
|
|
1235
|
+
};
|
|
1236
|
+
|
|
1190
1237
|
const getSortedSubsets = (base: Value[]) => {
|
|
1191
1238
|
const subsets: Value[] = [];
|
|
1192
1239
|
for (let size = 0; size <= base.length; size++) {
|
|
@@ -1215,9 +1262,7 @@ const enumerateSet = (value: Value): Value[] => {
|
|
|
1215
1262
|
if (isOverriddenSet(value.base)) getCardinality(value.base);
|
|
1216
1263
|
const base = toFiniteSet(value.base).elements;
|
|
1217
1264
|
if (base.length > MAXIMUM_ENUMERATED_SUBSET_BASE) {
|
|
1218
|
-
throw new TlaEvaluationError(
|
|
1219
|
-
`SUBSET of a set with ${base.length} elements is too large to enumerate`,
|
|
1220
|
-
);
|
|
1265
|
+
throw new TlaEvaluationError(describeOverflow(value));
|
|
1221
1266
|
}
|
|
1222
1267
|
return getSortedSubsets(base);
|
|
1223
1268
|
}
|
|
@@ -1281,7 +1326,7 @@ const enumerateSet = (value: Value): Value[] => {
|
|
|
1281
1326
|
case "SetOperation": {
|
|
1282
1327
|
if (
|
|
1283
1328
|
value.operator === "\\cup" &&
|
|
1284
|
-
(
|
|
1329
|
+
(!isTlcEnumerable(value.left) || !isTlcEnumerable(value.right))
|
|
1285
1330
|
) {
|
|
1286
1331
|
throw new TlaEvaluationError(
|
|
1287
1332
|
`Attempted to enumerate S \\cup T when S:\n${formatValue(value.left)}\nand T:\n${formatValue(value.right)}\nare not both enumerable`,
|
|
@@ -1289,14 +1334,14 @@ const enumerateSet = (value: Value): Value[] => {
|
|
|
1289
1334
|
}
|
|
1290
1335
|
if (
|
|
1291
1336
|
value.operator === "\\cap" &&
|
|
1292
|
-
|
|
1293
|
-
|
|
1337
|
+
!isTlcEnumerable(value.left) &&
|
|
1338
|
+
!isTlcEnumerable(value.right)
|
|
1294
1339
|
) {
|
|
1295
1340
|
throw new TlaEvaluationError(
|
|
1296
1341
|
`Attempted to enumerate S \\cap T when neither S:\n${formatValue(value.left)}\nnor T:\n${formatValue(value.right)}\nis enumerable`,
|
|
1297
1342
|
);
|
|
1298
1343
|
}
|
|
1299
|
-
if (value.operator === "\\" &&
|
|
1344
|
+
if (value.operator === "\\" && !isTlcEnumerable(value.left)) {
|
|
1300
1345
|
throw new TlaEvaluationError(
|
|
1301
1346
|
`Attempted to enumerate S \\ T when S:\n${formatValue(value.left)}\nis not enumerable.`,
|
|
1302
1347
|
);
|
|
@@ -1321,6 +1366,7 @@ const enumerateSet = (value: Value): Value[] => {
|
|
|
1321
1366
|
};
|
|
1322
1367
|
|
|
1323
1368
|
const finiteSets = new WeakMap<ObjectValue, SetValue>();
|
|
1369
|
+
const comparedSets = new WeakMap<ObjectValue, SetValue>();
|
|
1324
1370
|
|
|
1325
1371
|
export const toFiniteSet = (value: Value): SetValue => {
|
|
1326
1372
|
if (typeof value === "object" && value.kind === "Set") return value;
|
|
@@ -1329,6 +1375,16 @@ export const toFiniteSet = (value: Value): SetValue => {
|
|
|
1329
1375
|
}
|
|
1330
1376
|
const cached = typeof value === "object" ? finiteSets.get(value) : undefined;
|
|
1331
1377
|
if (cached) return cached;
|
|
1378
|
+
const set =
|
|
1379
|
+
(typeof value === "object" ? comparedSets.get(value) : undefined) ??
|
|
1380
|
+
(valueSources.current
|
|
1381
|
+
? withSource(value, () => enumerateFiniteSet(value))
|
|
1382
|
+
: enumerateFiniteSet(value));
|
|
1383
|
+
if (typeof value === "object") finiteSets.set(value, set);
|
|
1384
|
+
return set;
|
|
1385
|
+
};
|
|
1386
|
+
|
|
1387
|
+
const enumerateFiniteSet = (value: Value) => {
|
|
1332
1388
|
const elements = enumerateSet(value);
|
|
1333
1389
|
const isSorted =
|
|
1334
1390
|
typeof value === "object" &&
|
|
@@ -1339,8 +1395,20 @@ export const toFiniteSet = (value: Value): SetValue => {
|
|
|
1339
1395
|
value.kind === "ProductSet" ||
|
|
1340
1396
|
value.kind === "FunctionSet" ||
|
|
1341
1397
|
value.kind === "Subset");
|
|
1342
|
-
|
|
1343
|
-
|
|
1398
|
+
return isSorted ? createSortedSet(elements) : createSet(elements);
|
|
1399
|
+
};
|
|
1400
|
+
|
|
1401
|
+
// TLC converts the set a comparison receives as its argument without caching it, so a lazy set
|
|
1402
|
+
// compared that way still streams the sets it combines.
|
|
1403
|
+
const toComparedSet = (value: Value) => {
|
|
1404
|
+
const isStreamed =
|
|
1405
|
+
typeof value === "object" &&
|
|
1406
|
+
(value.kind === "Union" || value.kind === "SetOperation" || value.kind === "FilteredSet");
|
|
1407
|
+
if (!isStreamed || finiteSets.has(value)) return toFiniteSet(value);
|
|
1408
|
+
const compared = comparedSets.get(value);
|
|
1409
|
+
if (compared) return compared;
|
|
1410
|
+
const set = enumerateFiniteSet(value);
|
|
1411
|
+
comparedSets.set(value, set);
|
|
1344
1412
|
return set;
|
|
1345
1413
|
};
|
|
1346
1414
|
|
|
@@ -1360,14 +1428,14 @@ export const getStreamedElements = (value: Value): Value[] => {
|
|
|
1360
1428
|
}
|
|
1361
1429
|
if (value.kind !== "SetOperation") return toFiniteSet(value).elements;
|
|
1362
1430
|
if (value.operator === "\\cup") {
|
|
1363
|
-
return
|
|
1431
|
+
return !isTlcEnumerable(value.left) || !isTlcEnumerable(value.right)
|
|
1364
1432
|
? toFiniteSet(value).elements
|
|
1365
1433
|
: [...getStreamedElements(value.left), ...getStreamedElements(value.right)];
|
|
1366
1434
|
}
|
|
1367
1435
|
const isLeftEnumerated = value.operator === "\\" || isEnumerable(value.left);
|
|
1368
1436
|
const enumerated = isLeftEnumerated ? value.left : value.right;
|
|
1369
1437
|
const other = isLeftEnumerated ? value.right : value.left;
|
|
1370
|
-
if (
|
|
1438
|
+
if (!isTlcEnumerable(enumerated)) return toFiniteSet(value).elements;
|
|
1371
1439
|
return getStreamedElements(enumerated).filter(
|
|
1372
1440
|
(element) => isElementOf(element, other) === (value.operator === "\\cap"),
|
|
1373
1441
|
);
|
|
@@ -1570,6 +1638,12 @@ const describeNonSetMembership = (element: Value, value: Value) => {
|
|
|
1570
1638
|
return `${prefix} function ${formatValue(value)}`;
|
|
1571
1639
|
};
|
|
1572
1640
|
|
|
1641
|
+
// TLC checks membership in a set that another set holds through the inner set's own method.
|
|
1642
|
+
const isElementOfSet = (element: Value, set: Value) =>
|
|
1643
|
+
valueSources.current
|
|
1644
|
+
? withSource(set, () => isElementOf(element, set))
|
|
1645
|
+
: isElementOf(element, set);
|
|
1646
|
+
|
|
1573
1647
|
export const isElementOf = (element: Value, set: Value): boolean => {
|
|
1574
1648
|
if (!isSetValue(set)) throw new TlaEvaluationError(describeNonSetMembership(element, set));
|
|
1575
1649
|
switch (set.kind) {
|
|
@@ -1578,10 +1652,10 @@ export const isElementOf = (element: Value, set: Value): boolean => {
|
|
|
1578
1652
|
return findIndex(set.elements, element) !== -1;
|
|
1579
1653
|
} catch (error) {
|
|
1580
1654
|
if (!(error instanceof TlaEvaluationError)) throw error;
|
|
1581
|
-
return isElementOfLikeTlc(element, set.elements);
|
|
1655
|
+
return withSource(set, () => isElementOfLikeTlc(element, set.elements));
|
|
1582
1656
|
}
|
|
1583
1657
|
case "MixedSet":
|
|
1584
|
-
return isElementOfLikeTlc(element, set.elements);
|
|
1658
|
+
return withSource(set, () => isElementOfLikeTlc(element, set.elements));
|
|
1585
1659
|
case "Interval":
|
|
1586
1660
|
if (typeof element === "number") return element >= set.low && element <= set.high;
|
|
1587
1661
|
if (set.low <= set.high && !isModelValue(element)) {
|
|
@@ -1603,12 +1677,18 @@ export const isElementOf = (element: Value, set: Value): boolean => {
|
|
|
1603
1677
|
return set.name !== "Nat" || (typeof element === "number" && element >= 0);
|
|
1604
1678
|
}
|
|
1605
1679
|
case "Subset":
|
|
1606
|
-
if (!
|
|
1607
|
-
|
|
1680
|
+
if (!isTlcEnumerable(element)) {
|
|
1681
|
+
throw new TlaEvaluationError(
|
|
1682
|
+
`Attempted to check if the non-enumerable value\n${prettyPrint(formatValue(element))}\nis element of\n${prettyPrint(formatValue(set))}`,
|
|
1683
|
+
);
|
|
1684
|
+
}
|
|
1685
|
+
return toFiniteSet(element).elements.every((item) => isElementOfSet(item, set.base));
|
|
1608
1686
|
case "FunctionSet": {
|
|
1609
1687
|
if (!isFunctionValue(element)) {
|
|
1610
1688
|
if (isModelValue(element)) return false;
|
|
1611
|
-
throw new TlaEvaluationError(
|
|
1689
|
+
throw new TlaEvaluationError(
|
|
1690
|
+
`Attempted to check if \n${formatValue(element)}\nwhich is not a TLC function value, is in the set of functions:\n${prettyPrint(formatValue(set))}`,
|
|
1691
|
+
);
|
|
1612
1692
|
}
|
|
1613
1693
|
const functionValue = toFiniteFunction(element);
|
|
1614
1694
|
const low = getIntervalLow(functionValue.domain);
|
|
@@ -1619,7 +1699,7 @@ export const isElementOf = (element: Value, set: Value): boolean => {
|
|
|
1619
1699
|
{ kind: "Interval", low, high: low + functionValue.domain.length - 1 },
|
|
1620
1700
|
set.domain,
|
|
1621
1701
|
);
|
|
1622
|
-
return isDomain && functionValue.range.every((item) =>
|
|
1702
|
+
return isDomain && functionValue.range.every((item) => isElementOfSet(item, set.range));
|
|
1623
1703
|
}
|
|
1624
1704
|
case "RecordSet": {
|
|
1625
1705
|
const functionValue = isFunctionValue(element) ? toFiniteFunction(element) : undefined;
|
|
@@ -1633,7 +1713,7 @@ export const isElementOf = (element: Value, set: Value): boolean => {
|
|
|
1633
1713
|
functionValue.domain.length === set.names.length &&
|
|
1634
1714
|
set.names.every((name, index) => {
|
|
1635
1715
|
const position = findIndex(functionValue.domain, name);
|
|
1636
|
-
return position !== -1 &&
|
|
1716
|
+
return position !== -1 && isElementOfSet(functionValue.range[position], set.sets[index]);
|
|
1637
1717
|
})
|
|
1638
1718
|
);
|
|
1639
1719
|
}
|
|
@@ -1650,24 +1730,24 @@ export const isElementOf = (element: Value, set: Value): boolean => {
|
|
|
1650
1730
|
}
|
|
1651
1731
|
return (
|
|
1652
1732
|
elements.length === set.factors.length &&
|
|
1653
|
-
elements.every((item, index) =>
|
|
1733
|
+
elements.every((item, index) => isElementOfSet(item, set.factors[index]))
|
|
1654
1734
|
);
|
|
1655
1735
|
}
|
|
1656
1736
|
case "FilteredSet":
|
|
1657
|
-
return
|
|
1737
|
+
return isElementOfSet(element, set.base) && set.test(element);
|
|
1658
1738
|
case "Union":
|
|
1659
1739
|
if (!isTlcEnumerable(set.base)) {
|
|
1660
1740
|
throw new TlaEvaluationError(
|
|
1661
1741
|
`Attempted to check if:\n ${formatValue(element)}\nis an element of the non-enumerable set:\n ${formatUnion(set)}`,
|
|
1662
1742
|
);
|
|
1663
1743
|
}
|
|
1664
|
-
return toFiniteSet(set.base).elements.some((inner) =>
|
|
1744
|
+
return toFiniteSet(set.base).elements.some((inner) => isElementOfSet(element, inner));
|
|
1665
1745
|
case "SetOperation":
|
|
1666
1746
|
if (set.operator === "\\cup")
|
|
1667
|
-
return
|
|
1747
|
+
return isElementOfSet(element, set.left) || isElementOfSet(element, set.right);
|
|
1668
1748
|
return (
|
|
1669
|
-
|
|
1670
|
-
|
|
1749
|
+
isElementOfSet(element, set.left) &&
|
|
1750
|
+
isElementOfSet(element, set.right) === (set.operator === "\\cap")
|
|
1671
1751
|
);
|
|
1672
1752
|
case "SequenceSet": {
|
|
1673
1753
|
const elements = getSequenceElements(element);
|
|
@@ -1723,10 +1803,61 @@ export const markLambdaFunction = <FunctionLike extends FunctionValue | LazyFunc
|
|
|
1723
1803
|
return functionValue;
|
|
1724
1804
|
};
|
|
1725
1805
|
|
|
1726
|
-
|
|
1727
|
-
|
|
1728
|
-
|
|
1729
|
-
|
|
1806
|
+
// TLC applies a tuple, a record and a function over an interval with their own classes, and each
|
|
1807
|
+
// reports a missing argument in its own words.
|
|
1808
|
+
const getFunctionClass = (functionValue: FunctionValue) => {
|
|
1809
|
+
const domain = functionValue.domain;
|
|
1810
|
+
if (domain.length === 0) return lambdaFunctions.has(functionValue) ? "FcnRcdValue" : "TupleValue";
|
|
1811
|
+
if (domain === intervalDomains[domain.length]) return "TupleValue";
|
|
1812
|
+
if (intervalArrays.has(domain)) return "IntervalFcnRcdValue";
|
|
1813
|
+
return domain.every((key) => typeof key === "string") ? "RecordValue" : "FcnRcdValue";
|
|
1814
|
+
};
|
|
1815
|
+
|
|
1816
|
+
const describeNotInDomain = (functionValue: FunctionValue, argument: Value) =>
|
|
1817
|
+
`Attempted to apply function:\n${prettyPrint(formatValue(functionValue))}\nto argument ${prettyPrint(formatValue(argument))}, which is not in the domain of the function.`;
|
|
1818
|
+
|
|
1819
|
+
const describeNonIntegerArgument = (argument: Value) =>
|
|
1820
|
+
`Attempted to apply function with integer domain to the non-integer argument ${prettyPrint(formatValue(argument))}`;
|
|
1821
|
+
|
|
1822
|
+
const describeMissingArgument = (
|
|
1823
|
+
functionValue: FunctionValue | LazyFunctionValue,
|
|
1824
|
+
argument: Value,
|
|
1825
|
+
) => {
|
|
1826
|
+
if (lambdaFunctions.has(functionValue) || functionValue.kind === "LazyFunction")
|
|
1827
|
+
return `In applying the function\n${prettyPrint(formatValue(functionValue))},\nthe first argument is:\n${prettyPrint(formatValue(argument))}\nwhich is not in its domain.\n`;
|
|
1828
|
+
const functionClass = getFunctionClass(functionValue);
|
|
1829
|
+
if (functionClass === "TupleValue")
|
|
1830
|
+
return typeof argument === "number"
|
|
1831
|
+
? `Attempted to access index ${argument} of tuple\n${prettyPrint(formatValue(functionValue))}\nwhich is out of bounds.`
|
|
1832
|
+
: `Attempted to access tuple at a non integral index: ${prettyPrint(formatValue(argument))}`;
|
|
1833
|
+
if (functionClass === "RecordValue")
|
|
1834
|
+
return typeof argument === "string"
|
|
1835
|
+
? `Attempted to access nonexistent field '${argument}' of record\n${prettyPrint(formatValue(functionValue))}`
|
|
1836
|
+
: `Attempted to access record by a non-string argument: ${prettyPrint(formatValue(argument))}`;
|
|
1837
|
+
return functionClass === "IntervalFcnRcdValue" && typeof argument !== "number"
|
|
1838
|
+
? describeNonIntegerArgument(argument)
|
|
1839
|
+
: describeNotInDomain(functionValue, argument);
|
|
1840
|
+
};
|
|
1841
|
+
|
|
1842
|
+
// TLC selects a field of a value that isn't a record from the function the value converts to,
|
|
1843
|
+
// which keeps a tuple's domain as an interval.
|
|
1844
|
+
export const describeMissingField = (functionValue: FunctionValue, field: string) =>
|
|
1845
|
+
getFunctionClass(functionValue) === "FcnRcdValue"
|
|
1846
|
+
? describeNotInDomain(functionValue, field)
|
|
1847
|
+
: describeNonIntegerArgument(field);
|
|
1848
|
+
|
|
1849
|
+
export const isRecordValue = (functionValue: FunctionValue) =>
|
|
1850
|
+
getFunctionClass(functionValue) === "RecordValue";
|
|
1851
|
+
|
|
1852
|
+
// TLC checks the type of an argument to a tuple or a record before it looks the argument up, so
|
|
1853
|
+
// it never compares the argument with a key of another type.
|
|
1854
|
+
const isForeignKey = (domain: Value[], argument: Value) => {
|
|
1855
|
+
const first = domain[0];
|
|
1856
|
+
return typeof first === "number"
|
|
1857
|
+
? typeof argument !== "number" &&
|
|
1858
|
+
(domain === intervalDomains[domain.length] || intervalArrays.has(domain))
|
|
1859
|
+
: typeof first === "string" && typeof argument !== "string";
|
|
1860
|
+
};
|
|
1730
1861
|
|
|
1731
1862
|
const findKeyIndex = (domain: Value[], argument: Value) => {
|
|
1732
1863
|
const first = domain[0];
|
|
@@ -1745,6 +1876,7 @@ export const applyFunction = (
|
|
|
1745
1876
|
functionValue: Value,
|
|
1746
1877
|
argument: Value,
|
|
1747
1878
|
describeMissing?: (functionValue: FunctionValue) => string,
|
|
1879
|
+
describeNonFunction?: (value: Value) => string,
|
|
1748
1880
|
): Value => {
|
|
1749
1881
|
if (typeof functionValue === "object" && functionValue.kind === "LazyFunction") {
|
|
1750
1882
|
if (!isElementOf(argument, functionValue.domain)) {
|
|
@@ -1758,10 +1890,13 @@ export const applyFunction = (
|
|
|
1758
1890
|
}
|
|
1759
1891
|
if (typeof functionValue !== "object" || functionValue.kind !== "Function") {
|
|
1760
1892
|
throw new TlaEvaluationError(
|
|
1761
|
-
|
|
1893
|
+
describeNonFunction?.(functionValue) ??
|
|
1894
|
+
`Attempted to apply ${formatValue(functionValue)}, which is not a function`,
|
|
1762
1895
|
);
|
|
1763
1896
|
}
|
|
1764
|
-
const position =
|
|
1897
|
+
const position = isForeignKey(functionValue.domain, argument)
|
|
1898
|
+
? -1
|
|
1899
|
+
: findKeyIndex(functionValue.domain, argument);
|
|
1765
1900
|
if (position === -1) {
|
|
1766
1901
|
throw new TlaEvaluationError(
|
|
1767
1902
|
describeMissing?.(functionValue) ?? describeMissingArgument(functionValue, argument),
|
|
@@ -1859,10 +1994,15 @@ const getElementContribution = (element: Value) =>
|
|
|
1859
1994
|
const getEntryContribution = (key: Value, value: Value) =>
|
|
1860
1995
|
finalizeHash((Math.imul(getValueHash(key), 0x27d4eb2d) + getValueHash(value)) | 0);
|
|
1861
1996
|
|
|
1997
|
+
const unenumeratedSets = { isHashed: false };
|
|
1998
|
+
|
|
1862
1999
|
const computeValueHash = (value: ObjectValue) => {
|
|
1863
2000
|
if (value.kind === "ModelValue") return finalizeHash(combineHash(hashString(value.name), 0x6d));
|
|
1864
2001
|
if (isSetValue(value)) {
|
|
1865
|
-
if (!isEnumerable(value))
|
|
2002
|
+
if (!isEnumerable(value)) {
|
|
2003
|
+
unenumeratedSets.isHashed = true;
|
|
2004
|
+
return hashString(getValueKey(value));
|
|
2005
|
+
}
|
|
1866
2006
|
const elements = toFiniteSet(value).elements;
|
|
1867
2007
|
let hash = SET_HASH_SEED;
|
|
1868
2008
|
for (let index = 0; index < elements.length; index++) {
|
|
@@ -1894,6 +2034,25 @@ export const getValueHash = (value: Value): number => {
|
|
|
1894
2034
|
return hash;
|
|
1895
2035
|
};
|
|
1896
2036
|
|
|
2037
|
+
const fingerprintLikeTlc = (value: Value): void => {
|
|
2038
|
+
if (typeof value !== "object" || value.kind === "ModelValue") return;
|
|
2039
|
+
if (isOverriddenSet(value)) {
|
|
2040
|
+
throw new TlaEvaluationError(
|
|
2041
|
+
`TLC has found a state in which the value of a variable contains ${formatValue(value)}`,
|
|
2042
|
+
);
|
|
2043
|
+
}
|
|
2044
|
+
if (isSetValue(value)) return toFiniteSet(value).elements.forEach(fingerprintLikeTlc);
|
|
2045
|
+
const functionValue = toFiniteFunction(value);
|
|
2046
|
+
functionValue.domain.forEach(fingerprintLikeTlc);
|
|
2047
|
+
functionValue.range.forEach(fingerprintLikeTlc);
|
|
2048
|
+
};
|
|
2049
|
+
|
|
2050
|
+
// TLC enumerates every set in a state to fingerprint it, so it fails on a set it can't enumerate.
|
|
2051
|
+
// A state holds one only if hashing it met one, so states go unchecked until then.
|
|
2052
|
+
export const assertFingerprintable = (state: Value[]) => {
|
|
2053
|
+
if (unenumeratedSets.isHashed) state.forEach(fingerprintLikeTlc);
|
|
2054
|
+
};
|
|
2055
|
+
|
|
1897
2056
|
const valueFingerprints = new WeakMap<ObjectValue, number>();
|
|
1898
2057
|
|
|
1899
2058
|
const finalizeFingerprint = (hash: number) => {
|
|
@@ -1920,7 +2079,10 @@ const getEntryFingerprint = (key: Value, value: Value) =>
|
|
|
1920
2079
|
const computeValueFingerprint = (value: ObjectValue) => {
|
|
1921
2080
|
if (value.kind === "ModelValue") return finalizeFingerprint(fingerprintString(value.name) ^ 0x3c);
|
|
1922
2081
|
if (isSetValue(value)) {
|
|
1923
|
-
if (!isEnumerable(value))
|
|
2082
|
+
if (!isEnumerable(value)) {
|
|
2083
|
+
unenumeratedSets.isHashed = true;
|
|
2084
|
+
return fingerprintString(getValueKey(value));
|
|
2085
|
+
}
|
|
1924
2086
|
const elements = toFiniteSet(value).elements;
|
|
1925
2087
|
let fingerprint = 0x1b873593;
|
|
1926
2088
|
for (let index = 0; index < elements.length; index++) {
|
|
@@ -2106,8 +2268,11 @@ export const formatValue = (value: Value, isStrict = false, isNormalized = false
|
|
|
2106
2268
|
return `[${parameters} |-> <expression ${source.body}>]`;
|
|
2107
2269
|
}
|
|
2108
2270
|
const functionValue = toFiniteFunction(value);
|
|
2271
|
+
// TLC normalizes a lambda's domain to print it, but evaluates its body afterward.
|
|
2272
|
+
const formatRange = (inner: Value) =>
|
|
2273
|
+
formatValue(inner, isStrict, isNormalized && value.kind === "Function");
|
|
2109
2274
|
if (functionValue.domain.every((key, index) => key === index + 1)) {
|
|
2110
|
-
return `<<${functionValue.range.map(
|
|
2275
|
+
return `<<${functionValue.range.map(formatRange).join(", ")}>>`;
|
|
2111
2276
|
}
|
|
2112
2277
|
if (functionValue.domain.every((key) => typeof key === "string" && isFieldName(key))) {
|
|
2113
2278
|
const isSorted =
|
|
@@ -2115,9 +2280,9 @@ export const formatValue = (value: Value, isStrict = false, isNormalized = false
|
|
|
2115
2280
|
const pairs = isSorted
|
|
2116
2281
|
? functionValue.domain.map((key, index) => [key, functionValue.range[index]])
|
|
2117
2282
|
: getWrittenPairs(functionValue);
|
|
2118
|
-
return `[${pairs.map((pair) => `${String(pair[0])} |-> ${
|
|
2283
|
+
return `[${pairs.map((pair) => `${String(pair[0])} |-> ${formatRange(pair[1])}`).join(", ")}]`;
|
|
2119
2284
|
}
|
|
2120
|
-
return `(${functionValue.domain.map((key, index) => `${format(key)} :> ${
|
|
2285
|
+
return `(${functionValue.domain.map((key, index) => `${format(key)} :> ${formatRange(functionValue.range[index])}`).join(" @@ ")})`;
|
|
2121
2286
|
}
|
|
2122
2287
|
}
|
|
2123
2288
|
};
|