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.wf_εnv_implies_attrs_wf
Plain-language statement
SymEnv being well-formed implies that any attribute function is well-formed
Source project: Cedar Specification
Person-level attribution pending.
compile_binaryApp_wf_types
Plain-language statement
Similar to compileApp₂_wf_types, but for compile
Source project: Cedar Specification
Person-level attribution pending.
compile_ok_implies_compile_well_typed_binaryApp
Project documentation
Since we have the nice lemma compileApp₂_wf_types, it's enough to prove that compile of a binaryApp succeeds.
Source project: Cedar Specification
Person-level attribution pending.
compile_well_typed_on_wf_expr
Plain-language statement
Compiling a well-typed expression should produce a term of the corresponding TermType, assuming that the expression is well-formed in the symbolic environment.
Source project: Cedar Specification
Person-level attribution pending.
compile_well_typed_or_and
Plain-language statement
Combined case for or and and
Source project: Cedar Specification
Person-level attribution pending.
List.canonicalize_id_filter
Plain-language statement
Illustration that equiv_implies_canonical_eq does not hold for all functions f -- in particular, does not hold for Prod.fst. (One canonicalize produces [(1, false)], and the other produces [(1, true)].) -/ example : xs = [(1, false), (1, true)] → ys = [(1, true), (1, false)] → xs ≡ ys ∧ (canonicalize Prod.fst xs) ≠ (canonicalize Prod.fst ys) :...
Source project: Cedar Specification
Person-level attribution pending.