Pages that link to "Item:Q1600086"

The following pages link to Isabelle/HOL. A proof assistant for higher-order logic (Q1600086):

Displaying 16 items.

• A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle (Q286772) (← links)
• The higher-order prover \textsc{Leo}-II (Q287283) (← links)
• A mechanized proof of the basic perturbation lemma (Q928666) (← links)
• Organizing numerical theories using axiomatic type classes (Q1774558) (← links)
• Relation algebra as programming language using the Ampersand compiler (Q1785856) (← links)
• Formalizing the LLL basis reduction algorithm and the LLL factorization algorithm in Isabelle/HOL (Q2209537) (← links)
• Fifty years of Hoare's logic (Q2280214) (← links)
• Translating higher-order clauses to first-order clauses (Q2471742) (← links)
• Social choice theory in HOL. Arrow and Gibbard-Satterthwaite (Q2655324) (← links)
• An Isabelle/HOL Formalisation of Green’s Theorem (Q2829238) (← links)
• Towards Logical Frameworks in the Heterogeneous Tool Set Hets (Q2890328) (← links)
• Guarded Operations, Refinement and Simulation (Q2994496) (← links)
• Formalization and Execution of Linear Algebra: From Theorems to Algorithms (Q3453644) (← links)
• A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi (Q5179010) (← links)
• Formalisation in higher-order logic and code generation to functional languages of the Gauss-Jordan algorithm (Q5371950) (← links)
• A formal proof of the expressiveness of deep learning (Q5919583) (← links)