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 200 research declarations. Search 10,000 more complete Mathlib declarations.
200 results
Clear filtersCedar.Thm.value_symbolize?_not_some
Plain-language statement
The results of symbolize? is not Term.some.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.value_symbolize?_well_typed
Plain-language statement
The results of symbolize? has the correct type.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.value_symbolize?_wf
Plain-language statement
The results of symbolize? is well-formed.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyAlwaysAllows_is_complete
Plain-language statement
The verifyAlwaysAllows analysis is sound: if the assertions verifyAlwaysAllows ps₁ εnv are satisfiable for the policies ps₁ and the strongly well-formed symbolic environment εnv, then there exists a strongly well-formed concrete environment env ∈ᵢ εnv such that the authorizer will not return allow when applied to ps₁ and env.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyAlwaysAllows_is_ok_and_complete
Plain-language statement
Concrete version of verifyAlwaysAllows_is_complete.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyAlwaysAllows_is_ok_and_sound
Plain-language statement
Concrete version of verifyAlwaysAllows_is_sound.
Source project: Cedar Specification
Person-level attribution pending.