Pages that link to "Item:Q2055901"
From MaRDI portal
The following pages link to The Lean 4 theorem prover and programming language (Q2055901):
Displaying 17 items.
- Certifying algorithms and relevant properties of reversible primitive permutations with \textsf{Lean} (Q2097420) (← links)
- Flexible proof production in an industrial-strength SMT solver (Q2104495) (← links)
- A bi-directional extensible interface between Lean and Mathematica (Q2673306) (← links)
- Characteristics of de Bruijn’s early proof checker Automath (Q5089679) (← links)
- (Q5094129) (← links)
- The homological arrow polynomial for virtual links (Q5881438) (← links)
- The formal verification of the ctm approach to forcing (Q6151819) (← links)
- Specification and verification of a linear-time temporal logic for graph transformation (Q6535505) (← links)
- Verified reductions for optimization (Q6536123) (← links)
- Machine-learned premise selection for Lean (Q6541150) (← links)
- Schematic program proofs with abstract execution. Theory and applications (Q6552501) (← links)
- Machine learning and information theory concepts towards an AI mathematician (Q6554714) (← links)
- Algorithm and abstraction in formal mathematics (Q6637783) (← links)
- Formalising analysis in Lean: compactness and dimensionality (Q6637793) (← links)
- Maude2Lean: theorem proving for Maude specifications using Lean (Q6643468) (← links)
- Chaining extensionality lemmas in Lean's mathlib (Q6648155) (← links)
- Transforming optimization problems into disciplined convex programming form (Q6648168) (← links)
