tla-ts 0.0.3-dev.e927a09 → 0.0.3-dev.e9c5857
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/README.md +5 -1
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +52 -22
- package/dist/index.d.ts +52 -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 +19 -17
- package/dist/run-cli.js +20 -18
- package/dist/transfer.cjs +32 -15
- package/dist/transfer.js +32 -15
- package/package.json +1 -1
- package/src/ast.ts +3 -0
- package/src/check.ts +419 -68
- package/src/cli-options.ts +11 -5
- package/src/codegen.ts +6 -3
- package/src/config.ts +224 -170
- package/src/environment.ts +106 -18
- package/src/errors.ts +71 -3
- package/src/evaluate.ts +178 -23
- package/src/exit-codes.ts +21 -14
- package/src/instances.ts +4 -4
- package/src/levels.ts +55 -27
- package/src/live-check.ts +132 -70
- package/src/liveness.ts +117 -22
- package/src/parallel-worker.ts +2 -2
- package/src/parallel.ts +5 -2
- package/src/parser.ts +21 -10
- package/src/resolve.ts +106 -29
- package/src/run-cli.ts +90 -17
- package/src/runtime.ts +2 -0
- package/src/spec-description.ts +12 -6
- package/src/standard-modules.ts +10 -9
- package/src/state-graph.ts +157 -0
- package/src/successors.ts +131 -28
- package/src/symmetry.ts +16 -6
- package/src/tableau.ts +51 -24
- package/src/tlc-ext.ts +27 -2
- package/src/tlc-module.ts +14 -33
- 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 +172 -53
package/src/tlc-summary.ts
CHANGED
|
@@ -87,11 +87,26 @@ export const getFingerprintDistance = (
|
|
|
87
87
|
const probability = getOptimisticProbability(distinctStates, generatedStates);
|
|
88
88
|
if (probability < ACTUAL_PROBABILITY_THRESHOLD) return undefined;
|
|
89
89
|
const fingerprints = getFingerprints().sort();
|
|
90
|
-
|
|
91
|
-
|
|
92
|
-
|
|
93
|
-
|
|
94
|
-
|
|
90
|
+
// The low and high words of each fingerprint. A gap whose high words differ by at most 2^20 is
|
|
91
|
+
// below 2^53, so a number holds it exactly and only wider gaps need a BigInt.
|
|
92
|
+
const words = new Int32Array(fingerprints.buffer);
|
|
93
|
+
const nearest = { narrow: Number.POSITIVE_INFINITY, wide: 0x7fff_ffff_ffff_ffffn };
|
|
94
|
+
for (let index = 1; index < fingerprints.length; index++) {
|
|
95
|
+
const high = words[2 * index + 1];
|
|
96
|
+
const previousHigh = words[2 * index - 1];
|
|
97
|
+
if (high < 0 !== previousHigh < 0) continue;
|
|
98
|
+
const highGap = high - previousHigh;
|
|
99
|
+
if (highGap <= 0x10_0000) {
|
|
100
|
+
const gap = highGap * 0x1_0000_0000 + (words[2 * index] >>> 0) - (words[2 * index - 2] >>> 0);
|
|
101
|
+
nearest.narrow = Math.min(nearest.narrow, gap);
|
|
102
|
+
} else {
|
|
103
|
+
const gap = fingerprints[index] - fingerprints[index - 1];
|
|
104
|
+
if (gap < nearest.wide) nearest.wide = gap;
|
|
105
|
+
}
|
|
106
|
+
}
|
|
107
|
+
if (nearest.narrow === Number.POSITIVE_INFINITY) return nearest.wide;
|
|
108
|
+
const narrow = BigInt(nearest.narrow);
|
|
109
|
+
return narrow < nearest.wide ? narrow : nearest.wide;
|
|
95
110
|
};
|
|
96
111
|
|
|
97
112
|
export const getOutDegreeSummary = (buckets: number[]) => {
|
|
@@ -0,0 +1,29 @@
|
|
|
1
|
+
import type { Expression } from "./ast";
|
|
2
|
+
import { TlaEvaluationError } from "./errors";
|
|
3
|
+
import type { Value } from "./values";
|
|
4
|
+
|
|
5
|
+
// While TLC replays a failure, it gives each set, tuple or record it builds the expression that
|
|
6
|
+
// built it. A method of such a value that fails prepends that expression to the error's trace, and
|
|
7
|
+
// TLC reports the error as one it was unable to fingerprint.
|
|
8
|
+
export const valueSources: { current: WeakMap<object, Expression> | undefined } = {
|
|
9
|
+
current: undefined,
|
|
10
|
+
};
|
|
11
|
+
|
|
12
|
+
const fingerprintTraces = new WeakMap<TlaEvaluationError, Expression[]>();
|
|
13
|
+
|
|
14
|
+
export const getFingerprintTrace = (error: unknown) =>
|
|
15
|
+
error instanceof TlaEvaluationError ? fingerprintTraces.get(error) : undefined;
|
|
16
|
+
|
|
17
|
+
export const withSource = <T>(value: Value, run: () => T): T => {
|
|
18
|
+
const sources = valueSources.current;
|
|
19
|
+
if (!sources || typeof value !== "object") return run();
|
|
20
|
+
try {
|
|
21
|
+
return run();
|
|
22
|
+
} catch (error) {
|
|
23
|
+
const source = sources.get(value);
|
|
24
|
+
if (source && error instanceof TlaEvaluationError) {
|
|
25
|
+
fingerprintTraces.set(error, [source, ...(fingerprintTraces.get(error) ?? [])]);
|
|
26
|
+
}
|
|
27
|
+
throw error;
|
|
28
|
+
}
|
|
29
|
+
};
|
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
|
};
|
|
@@ -1069,13 +1081,16 @@ const isTlcEnumerable = (value: Value) => isSetValue(value) && !isOverriddenSet(
|
|
|
1069
1081
|
const formatUnion = (value: UnionValue, isStrict = false) =>
|
|
1070
1082
|
`UNION(${formatValue(value.base, isStrict)})`;
|
|
1071
1083
|
|
|
1072
|
-
const getUnionSets = (
|
|
1084
|
+
const getUnionSets = (
|
|
1085
|
+
value: UnionValue,
|
|
1086
|
+
getElements = (set: Value) => toFiniteSet(set).elements,
|
|
1087
|
+
) => {
|
|
1073
1088
|
if (!isTlcEnumerable(value.base)) {
|
|
1074
1089
|
throw new TlaEvaluationError(
|
|
1075
1090
|
`Attempted to enumerate the nonenumerable set:\n${formatUnion(value)}`,
|
|
1076
1091
|
);
|
|
1077
1092
|
}
|
|
1078
|
-
return
|
|
1093
|
+
return getElements(value.base);
|
|
1079
1094
|
};
|
|
1080
1095
|
|
|
1081
1096
|
const getUnionSet = (set: Value, index: number, union: UnionValue) => {
|
|
@@ -1111,7 +1126,7 @@ export const isEnumerable = (value: Value): boolean => {
|
|
|
1111
1126
|
case "ProductSet":
|
|
1112
1127
|
return value.factors.every(isEnumerable) || getEmptiness(value) === true;
|
|
1113
1128
|
case "Union":
|
|
1114
|
-
return isEnumerable(value.base) &&
|
|
1129
|
+
return isEnumerable(value.base) && getStreamedElements(value.base).every(isEnumerable);
|
|
1115
1130
|
case "SetOperation":
|
|
1116
1131
|
if (value.operator === "\\cup") return isEnumerable(value.left) && isEnumerable(value.right);
|
|
1117
1132
|
if (value.operator === "\\cap") return isEnumerable(value.left) || isEnumerable(value.right);
|
|
@@ -1212,9 +1227,7 @@ const enumerateSet = (value: Value): Value[] => {
|
|
|
1212
1227
|
if (isOverriddenSet(value.base)) getCardinality(value.base);
|
|
1213
1228
|
const base = toFiniteSet(value.base).elements;
|
|
1214
1229
|
if (base.length > MAXIMUM_ENUMERATED_SUBSET_BASE) {
|
|
1215
|
-
throw new TlaEvaluationError(
|
|
1216
|
-
`SUBSET of a set with ${base.length} elements is too large to enumerate`,
|
|
1217
|
-
);
|
|
1230
|
+
throw new TlaEvaluationError(describeOverflow(value));
|
|
1218
1231
|
}
|
|
1219
1232
|
return getSortedSubsets(base);
|
|
1220
1233
|
}
|
|
@@ -1318,6 +1331,7 @@ const enumerateSet = (value: Value): Value[] => {
|
|
|
1318
1331
|
};
|
|
1319
1332
|
|
|
1320
1333
|
const finiteSets = new WeakMap<ObjectValue, SetValue>();
|
|
1334
|
+
const comparedSets = new WeakMap<ObjectValue, SetValue>();
|
|
1321
1335
|
|
|
1322
1336
|
export const toFiniteSet = (value: Value): SetValue => {
|
|
1323
1337
|
if (typeof value === "object" && value.kind === "Set") return value;
|
|
@@ -1326,6 +1340,16 @@ export const toFiniteSet = (value: Value): SetValue => {
|
|
|
1326
1340
|
}
|
|
1327
1341
|
const cached = typeof value === "object" ? finiteSets.get(value) : undefined;
|
|
1328
1342
|
if (cached) return cached;
|
|
1343
|
+
const set =
|
|
1344
|
+
(typeof value === "object" ? comparedSets.get(value) : undefined) ??
|
|
1345
|
+
(valueSources.current
|
|
1346
|
+
? withSource(value, () => enumerateFiniteSet(value))
|
|
1347
|
+
: enumerateFiniteSet(value));
|
|
1348
|
+
if (typeof value === "object") finiteSets.set(value, set);
|
|
1349
|
+
return set;
|
|
1350
|
+
};
|
|
1351
|
+
|
|
1352
|
+
const enumerateFiniteSet = (value: Value) => {
|
|
1329
1353
|
const elements = enumerateSet(value);
|
|
1330
1354
|
const isSorted =
|
|
1331
1355
|
typeof value === "object" &&
|
|
@@ -1336,8 +1360,20 @@ export const toFiniteSet = (value: Value): SetValue => {
|
|
|
1336
1360
|
value.kind === "ProductSet" ||
|
|
1337
1361
|
value.kind === "FunctionSet" ||
|
|
1338
1362
|
value.kind === "Subset");
|
|
1339
|
-
|
|
1340
|
-
|
|
1363
|
+
return isSorted ? createSortedSet(elements) : createSet(elements);
|
|
1364
|
+
};
|
|
1365
|
+
|
|
1366
|
+
// TLC converts the set a comparison receives as its argument without caching it, so a lazy set
|
|
1367
|
+
// compared that way still streams the sets it combines.
|
|
1368
|
+
const toComparedSet = (value: Value) => {
|
|
1369
|
+
const isStreamed =
|
|
1370
|
+
typeof value === "object" &&
|
|
1371
|
+
(value.kind === "Union" || value.kind === "SetOperation" || value.kind === "FilteredSet");
|
|
1372
|
+
if (!isStreamed || finiteSets.has(value)) return toFiniteSet(value);
|
|
1373
|
+
const compared = comparedSets.get(value);
|
|
1374
|
+
if (compared) return compared;
|
|
1375
|
+
const set = enumerateFiniteSet(value);
|
|
1376
|
+
comparedSets.set(value, set);
|
|
1341
1377
|
return set;
|
|
1342
1378
|
};
|
|
1343
1379
|
|
|
@@ -1345,8 +1381,10 @@ export const toFiniteSet = (value: Value): SetValue => {
|
|
|
1345
1381
|
// so an element that two of them share comes up once for each.
|
|
1346
1382
|
export const getStreamedElements = (value: Value): Value[] => {
|
|
1347
1383
|
if (typeof value !== "object" || finiteSets.has(value)) return toFiniteSet(value).elements;
|
|
1384
|
+
// TLC streams the sets of a UNION it hasn't enumerated, so a set that appears twice there yields
|
|
1385
|
+
// its elements twice.
|
|
1348
1386
|
if (value.kind === "Union") {
|
|
1349
|
-
return getUnionSets(value).flatMap((set, index) =>
|
|
1387
|
+
return getUnionSets(value, getStreamedElements).flatMap((set, index) =>
|
|
1350
1388
|
getStreamedElements(getUnionSet(set, index, value)),
|
|
1351
1389
|
);
|
|
1352
1390
|
}
|
|
@@ -1565,6 +1603,12 @@ const describeNonSetMembership = (element: Value, value: Value) => {
|
|
|
1565
1603
|
return `${prefix} function ${formatValue(value)}`;
|
|
1566
1604
|
};
|
|
1567
1605
|
|
|
1606
|
+
// TLC checks membership in a set that another set holds through the inner set's own method.
|
|
1607
|
+
const isElementOfSet = (element: Value, set: Value) =>
|
|
1608
|
+
valueSources.current
|
|
1609
|
+
? withSource(set, () => isElementOf(element, set))
|
|
1610
|
+
: isElementOf(element, set);
|
|
1611
|
+
|
|
1568
1612
|
export const isElementOf = (element: Value, set: Value): boolean => {
|
|
1569
1613
|
if (!isSetValue(set)) throw new TlaEvaluationError(describeNonSetMembership(element, set));
|
|
1570
1614
|
switch (set.kind) {
|
|
@@ -1573,10 +1617,10 @@ export const isElementOf = (element: Value, set: Value): boolean => {
|
|
|
1573
1617
|
return findIndex(set.elements, element) !== -1;
|
|
1574
1618
|
} catch (error) {
|
|
1575
1619
|
if (!(error instanceof TlaEvaluationError)) throw error;
|
|
1576
|
-
return isElementOfLikeTlc(element, set.elements);
|
|
1620
|
+
return withSource(set, () => isElementOfLikeTlc(element, set.elements));
|
|
1577
1621
|
}
|
|
1578
1622
|
case "MixedSet":
|
|
1579
|
-
return isElementOfLikeTlc(element, set.elements);
|
|
1623
|
+
return withSource(set, () => isElementOfLikeTlc(element, set.elements));
|
|
1580
1624
|
case "Interval":
|
|
1581
1625
|
if (typeof element === "number") return element >= set.low && element <= set.high;
|
|
1582
1626
|
if (set.low <= set.high && !isModelValue(element)) {
|
|
@@ -1598,12 +1642,18 @@ export const isElementOf = (element: Value, set: Value): boolean => {
|
|
|
1598
1642
|
return set.name !== "Nat" || (typeof element === "number" && element >= 0);
|
|
1599
1643
|
}
|
|
1600
1644
|
case "Subset":
|
|
1601
|
-
if (!
|
|
1602
|
-
|
|
1645
|
+
if (!isTlcEnumerable(element)) {
|
|
1646
|
+
throw new TlaEvaluationError(
|
|
1647
|
+
`Attempted to check if the non-enumerable value\n${prettyPrint(formatValue(element))}\nis element of\n${prettyPrint(formatValue(set))}`,
|
|
1648
|
+
);
|
|
1649
|
+
}
|
|
1650
|
+
return toFiniteSet(element).elements.every((item) => isElementOfSet(item, set.base));
|
|
1603
1651
|
case "FunctionSet": {
|
|
1604
1652
|
if (!isFunctionValue(element)) {
|
|
1605
1653
|
if (isModelValue(element)) return false;
|
|
1606
|
-
throw new TlaEvaluationError(
|
|
1654
|
+
throw new TlaEvaluationError(
|
|
1655
|
+
`Attempted to check if \n${formatValue(element)}\nwhich is not a TLC function value, is in the set of functions:\n${prettyPrint(formatValue(set))}`,
|
|
1656
|
+
);
|
|
1607
1657
|
}
|
|
1608
1658
|
const functionValue = toFiniteFunction(element);
|
|
1609
1659
|
const low = getIntervalLow(functionValue.domain);
|
|
@@ -1614,7 +1664,7 @@ export const isElementOf = (element: Value, set: Value): boolean => {
|
|
|
1614
1664
|
{ kind: "Interval", low, high: low + functionValue.domain.length - 1 },
|
|
1615
1665
|
set.domain,
|
|
1616
1666
|
);
|
|
1617
|
-
return isDomain && functionValue.range.every((item) =>
|
|
1667
|
+
return isDomain && functionValue.range.every((item) => isElementOfSet(item, set.range));
|
|
1618
1668
|
}
|
|
1619
1669
|
case "RecordSet": {
|
|
1620
1670
|
const functionValue = isFunctionValue(element) ? toFiniteFunction(element) : undefined;
|
|
@@ -1628,7 +1678,7 @@ export const isElementOf = (element: Value, set: Value): boolean => {
|
|
|
1628
1678
|
functionValue.domain.length === set.names.length &&
|
|
1629
1679
|
set.names.every((name, index) => {
|
|
1630
1680
|
const position = findIndex(functionValue.domain, name);
|
|
1631
|
-
return position !== -1 &&
|
|
1681
|
+
return position !== -1 && isElementOfSet(functionValue.range[position], set.sets[index]);
|
|
1632
1682
|
})
|
|
1633
1683
|
);
|
|
1634
1684
|
}
|
|
@@ -1645,24 +1695,24 @@ export const isElementOf = (element: Value, set: Value): boolean => {
|
|
|
1645
1695
|
}
|
|
1646
1696
|
return (
|
|
1647
1697
|
elements.length === set.factors.length &&
|
|
1648
|
-
elements.every((item, index) =>
|
|
1698
|
+
elements.every((item, index) => isElementOfSet(item, set.factors[index]))
|
|
1649
1699
|
);
|
|
1650
1700
|
}
|
|
1651
1701
|
case "FilteredSet":
|
|
1652
|
-
return
|
|
1702
|
+
return isElementOfSet(element, set.base) && set.test(element);
|
|
1653
1703
|
case "Union":
|
|
1654
1704
|
if (!isTlcEnumerable(set.base)) {
|
|
1655
1705
|
throw new TlaEvaluationError(
|
|
1656
1706
|
`Attempted to check if:\n ${formatValue(element)}\nis an element of the non-enumerable set:\n ${formatUnion(set)}`,
|
|
1657
1707
|
);
|
|
1658
1708
|
}
|
|
1659
|
-
return toFiniteSet(set.base).elements.some((inner) =>
|
|
1709
|
+
return toFiniteSet(set.base).elements.some((inner) => isElementOfSet(element, inner));
|
|
1660
1710
|
case "SetOperation":
|
|
1661
1711
|
if (set.operator === "\\cup")
|
|
1662
|
-
return
|
|
1712
|
+
return isElementOfSet(element, set.left) || isElementOfSet(element, set.right);
|
|
1663
1713
|
return (
|
|
1664
|
-
|
|
1665
|
-
|
|
1714
|
+
isElementOfSet(element, set.left) &&
|
|
1715
|
+
isElementOfSet(element, set.right) === (set.operator === "\\cap")
|
|
1666
1716
|
);
|
|
1667
1717
|
case "SequenceSet": {
|
|
1668
1718
|
const elements = getSequenceElements(element);
|
|
@@ -1718,10 +1768,61 @@ export const markLambdaFunction = <FunctionLike extends FunctionValue | LazyFunc
|
|
|
1718
1768
|
return functionValue;
|
|
1719
1769
|
};
|
|
1720
1770
|
|
|
1721
|
-
|
|
1722
|
-
|
|
1723
|
-
|
|
1724
|
-
|
|
1771
|
+
// TLC applies a tuple, a record and a function over an interval with their own classes, and each
|
|
1772
|
+
// reports a missing argument in its own words.
|
|
1773
|
+
const getFunctionClass = (functionValue: FunctionValue) => {
|
|
1774
|
+
const domain = functionValue.domain;
|
|
1775
|
+
if (domain.length === 0) return lambdaFunctions.has(functionValue) ? "FcnRcdValue" : "TupleValue";
|
|
1776
|
+
if (domain === intervalDomains[domain.length]) return "TupleValue";
|
|
1777
|
+
if (intervalArrays.has(domain)) return "IntervalFcnRcdValue";
|
|
1778
|
+
return domain.every((key) => typeof key === "string") ? "RecordValue" : "FcnRcdValue";
|
|
1779
|
+
};
|
|
1780
|
+
|
|
1781
|
+
const describeNotInDomain = (functionValue: FunctionValue, argument: Value) =>
|
|
1782
|
+
`Attempted to apply function:\n${prettyPrint(formatValue(functionValue))}\nto argument ${prettyPrint(formatValue(argument))}, which is not in the domain of the function.`;
|
|
1783
|
+
|
|
1784
|
+
const describeNonIntegerArgument = (argument: Value) =>
|
|
1785
|
+
`Attempted to apply function with integer domain to the non-integer argument ${prettyPrint(formatValue(argument))}`;
|
|
1786
|
+
|
|
1787
|
+
const describeMissingArgument = (
|
|
1788
|
+
functionValue: FunctionValue | LazyFunctionValue,
|
|
1789
|
+
argument: Value,
|
|
1790
|
+
) => {
|
|
1791
|
+
if (lambdaFunctions.has(functionValue) || functionValue.kind === "LazyFunction")
|
|
1792
|
+
return `In applying the function\n${prettyPrint(formatValue(functionValue))},\nthe first argument is:\n${prettyPrint(formatValue(argument))}\nwhich is not in its domain.\n`;
|
|
1793
|
+
const functionClass = getFunctionClass(functionValue);
|
|
1794
|
+
if (functionClass === "TupleValue")
|
|
1795
|
+
return typeof argument === "number"
|
|
1796
|
+
? `Attempted to access index ${argument} of tuple\n${prettyPrint(formatValue(functionValue))}\nwhich is out of bounds.`
|
|
1797
|
+
: `Attempted to access tuple at a non integral index: ${prettyPrint(formatValue(argument))}`;
|
|
1798
|
+
if (functionClass === "RecordValue")
|
|
1799
|
+
return typeof argument === "string"
|
|
1800
|
+
? `Attempted to access nonexistent field '${argument}' of record\n${prettyPrint(formatValue(functionValue))}`
|
|
1801
|
+
: `Attempted to access record by a non-string argument: ${prettyPrint(formatValue(argument))}`;
|
|
1802
|
+
return functionClass === "IntervalFcnRcdValue" && typeof argument !== "number"
|
|
1803
|
+
? describeNonIntegerArgument(argument)
|
|
1804
|
+
: describeNotInDomain(functionValue, argument);
|
|
1805
|
+
};
|
|
1806
|
+
|
|
1807
|
+
// TLC selects a field of a value that isn't a record from the function the value converts to,
|
|
1808
|
+
// which keeps a tuple's domain as an interval.
|
|
1809
|
+
export const describeMissingField = (functionValue: FunctionValue, field: string) =>
|
|
1810
|
+
getFunctionClass(functionValue) === "FcnRcdValue"
|
|
1811
|
+
? describeNotInDomain(functionValue, field)
|
|
1812
|
+
: describeNonIntegerArgument(field);
|
|
1813
|
+
|
|
1814
|
+
export const isRecordValue = (functionValue: FunctionValue) =>
|
|
1815
|
+
getFunctionClass(functionValue) === "RecordValue";
|
|
1816
|
+
|
|
1817
|
+
// TLC checks the type of an argument to a tuple or a record before it looks the argument up, so
|
|
1818
|
+
// it never compares the argument with a key of another type.
|
|
1819
|
+
const isForeignKey = (domain: Value[], argument: Value) => {
|
|
1820
|
+
const first = domain[0];
|
|
1821
|
+
return typeof first === "number"
|
|
1822
|
+
? typeof argument !== "number" &&
|
|
1823
|
+
(domain === intervalDomains[domain.length] || intervalArrays.has(domain))
|
|
1824
|
+
: typeof first === "string" && typeof argument !== "string";
|
|
1825
|
+
};
|
|
1725
1826
|
|
|
1726
1827
|
const findKeyIndex = (domain: Value[], argument: Value) => {
|
|
1727
1828
|
const first = domain[0];
|
|
@@ -1740,6 +1841,7 @@ export const applyFunction = (
|
|
|
1740
1841
|
functionValue: Value,
|
|
1741
1842
|
argument: Value,
|
|
1742
1843
|
describeMissing?: (functionValue: FunctionValue) => string,
|
|
1844
|
+
describeNonFunction?: (value: Value) => string,
|
|
1743
1845
|
): Value => {
|
|
1744
1846
|
if (typeof functionValue === "object" && functionValue.kind === "LazyFunction") {
|
|
1745
1847
|
if (!isElementOf(argument, functionValue.domain)) {
|
|
@@ -1753,10 +1855,13 @@ export const applyFunction = (
|
|
|
1753
1855
|
}
|
|
1754
1856
|
if (typeof functionValue !== "object" || functionValue.kind !== "Function") {
|
|
1755
1857
|
throw new TlaEvaluationError(
|
|
1756
|
-
|
|
1858
|
+
describeNonFunction?.(functionValue) ??
|
|
1859
|
+
`Attempted to apply ${formatValue(functionValue)}, which is not a function`,
|
|
1757
1860
|
);
|
|
1758
1861
|
}
|
|
1759
|
-
const position =
|
|
1862
|
+
const position = isForeignKey(functionValue.domain, argument)
|
|
1863
|
+
? -1
|
|
1864
|
+
: findKeyIndex(functionValue.domain, argument);
|
|
1760
1865
|
if (position === -1) {
|
|
1761
1866
|
throw new TlaEvaluationError(
|
|
1762
1867
|
describeMissing?.(functionValue) ?? describeMissingArgument(functionValue, argument),
|
|
@@ -2101,8 +2206,11 @@ export const formatValue = (value: Value, isStrict = false, isNormalized = false
|
|
|
2101
2206
|
return `[${parameters} |-> <expression ${source.body}>]`;
|
|
2102
2207
|
}
|
|
2103
2208
|
const functionValue = toFiniteFunction(value);
|
|
2209
|
+
// TLC normalizes a lambda's domain to print it, but evaluates its body afterward.
|
|
2210
|
+
const formatRange = (inner: Value) =>
|
|
2211
|
+
formatValue(inner, isStrict, isNormalized && value.kind === "Function");
|
|
2104
2212
|
if (functionValue.domain.every((key, index) => key === index + 1)) {
|
|
2105
|
-
return `<<${functionValue.range.map(
|
|
2213
|
+
return `<<${functionValue.range.map(formatRange).join(", ")}>>`;
|
|
2106
2214
|
}
|
|
2107
2215
|
if (functionValue.domain.every((key) => typeof key === "string" && isFieldName(key))) {
|
|
2108
2216
|
const isSorted =
|
|
@@ -2110,9 +2218,20 @@ export const formatValue = (value: Value, isStrict = false, isNormalized = false
|
|
|
2110
2218
|
const pairs = isSorted
|
|
2111
2219
|
? functionValue.domain.map((key, index) => [key, functionValue.range[index]])
|
|
2112
2220
|
: getWrittenPairs(functionValue);
|
|
2113
|
-
return `[${pairs.map((pair) => `${String(pair[0])} |-> ${
|
|
2221
|
+
return `[${pairs.map((pair) => `${String(pair[0])} |-> ${formatRange(pair[1])}`).join(", ")}]`;
|
|
2114
2222
|
}
|
|
2115
|
-
return `(${functionValue.domain.map((key, index) => `${format(key)} :> ${
|
|
2223
|
+
return `(${functionValue.domain.map((key, index) => `${format(key)} :> ${formatRange(functionValue.range[index])}`).join(" @@ ")})`;
|
|
2116
2224
|
}
|
|
2117
2225
|
}
|
|
2118
2226
|
};
|
|
2227
|
+
|
|
2228
|
+
// TLC's TLCState.toString: a line per variable, as a conjunction when there are several.
|
|
2229
|
+
export const formatState = (state: Record<string, Value>) => {
|
|
2230
|
+
const entries = Object.entries(state);
|
|
2231
|
+
return entries
|
|
2232
|
+
.map(
|
|
2233
|
+
([name, value]) =>
|
|
2234
|
+
`${entries.length === 1 ? "" : "/\\ "}${name} = ${prettyPrint(formatValue(value))}\n`,
|
|
2235
|
+
)
|
|
2236
|
+
.join("");
|
|
2237
|
+
};
|