Source-pinned research
Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.
This index contains 5 research declarations. Search 10,000 more complete Mathlib declarations.
5 results
Clear filtersCedar.Thm.verifyAlwaysAllowsOpt_eqv_verifyAlwaysAllows_ok
Project documentation
This theorem covers the "happy path" -- showing that if optimized policy compilation succeeds, then verifyAlwaysAllows and verifyAlwaysAllowsOpt are equivalent.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyAlwaysDeniesOpt_eqv_verifyAlwaysDenies_ok
Project documentation
This theorem covers the "happy path" -- showing that if optimized policy compilation succeeds, then verifyAlwaysAllows and verifyAlwaysAllowsOpt are equivalent.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyEvaluateOpt_eqv_verifyEvaluate_ok
Project documentation
This theorem covers the "happy path" -- showing that if optimized policy compilation succeeds, then verifyEvaluate and verifyEvaluateOpt are equivalent.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyEvaluatePairOpt_eqv_verifyEvaluatePair_ok
Project documentation
This theorem covers the "happy path" -- showing that if optimized policy compilation succeeds, then verifyEvaluatePair and verifyEvaluatePairOpt are equivalent.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyIsAuthorizedOpt_eqv_verifyIsAuthorized_ok
Project documentation
This theorem covers the "happy path" -- showing that if optimized policy compilation succeeds, then verifyIsAuthorized and verifyIsAuthorizedOpt are equivalent.
Source project: Cedar Specification
Person-level attribution pending.