Research proof index

Scope-based bounds are sound.

If an entity is reachable in n steps, then it must be included in slice at n. This lemma talks about the inner slicing function, so it's possible that the entity isn't in the original entities if it's in work.

A sound bound analysis produces sound policy slices.

wellTypedPolicy preserves Entities.ValidRefsFor.

If an expression is well-typed according to the typechecker, and the input environment and capabilities satisfy some invariants, then either (1) evaluation produces a value of the returned type or (2) it returns an error of type entityDoesNotExist, extensionError, or arithBoundsError. Both options are encoded in the EvaluatesTo predicate.

If typechecking succeeds, then for any request consistent with the schema, either (1) evaluation produces a boolean or (2) it returns an error of type entityDoesNotExist, extensionError, or arithBoundsError. Both options are encoded in the EvaluatesTo predicate. The type checker cannot protect against these errors because it has no knowledge of th...