The following pages link to Lean (Q27041):
Displaying 25 items.
- Validating Mathematical Structures (Q5048998) (← links)
- Formalization of Forcing in Isabelle/ZF (Q5049004) (← links)
- Characteristics of de Bruijn’s early proof checker Automath (Q5089679) (← links)
- (Q5094129) (← links)
- Schemes in Lean (Q5094471) (← links)
- Simple Type Theory is not too Simple: Grothendieck’s Schemes Without Dependent Types (Q5094472) (← links)
- Formalizing Galois Theory (Q5094476) (← links)
- Elaborating dependent (co)pattern matching: No pattern left behind (Q5110925) (← links)
- Higher Groups in Homotopy Type Theory (Q5145293) (← links)
- (Q5219923) (← links)
- MODULARITY IN MATHEMATICS (Q5221289) (← links)
- Implementing type theory in higher order constraint logic programming (Q5236551) (← links)
- Bar Induction is Compatible with Constructive Type Theory (Q5244386) (← links)
- Eliminating dependent pattern matching without K (Q5371975) (← links)
- (Q5856405) (← links)
- (Q5856420) (← links)
- (Q5875411) (← links)
- (Q5875427) (← links)
- (Q5875441) (← links)
- Verified Decision Procedures for Modal Logics. (Q5875443) (← links)
- Declarative Proof Translation (Short Paper) (Q5875449) (← links)
- The homological arrow polynomial for virtual links (Q5881438) (← links)
- Calculational relation-algebraic proofs in the teaching tool \textsc{CalcCheck} (Q5919026) (← links)
- continuum hypothesis (Q6481277) (← links)
- Lean formalization of Vitali convergence theorem (Q6672180) (← links)