Pages that link to "Item:Q3613436"
From MaRDI portal
The following pages link to Partial Recursive Functions in Higher-Order Logic (Q3613436):
Displaying 19 items.
- A two-valued logic for properties of strict functional programs allowing partial functions (Q352946) (← links)
- Amortized complexity verified (Q670702) (← links)
- Partial and nested recursive function definitions in higher-order logic (Q972425) (← links)
- A verified SAT solver framework with learn, forget, restart, and incrementality (Q1663234) (← links)
- Flyspeck II: The basic linear programs (Q2379683) (← links)
- On the Key Dependent Message Security of the Fujisaki-Okamoto Constructions (Q2798773) (← links)
- Another Look at Function Domains (Q2805150) (← links)
- A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality (Q2817909) (← links)
- A compiled implementation of normalisation by evaluation (Q2913943) (← links)
- Pattern Matches in HOL: (Q2945657) (← links)
- Friends with Benefits (Q2988636) (← links)
- Formalizing the Logic-Automaton Connection (Q3183526) (← links)
- Formalising FinFuns – Generating Code for Functions as Data from Isabelle/HOL (Q3183537) (← links)
- The Isabelle Framework (Q3543647) (← links)
- A Compiled Implementation of Normalization by Evaluation (Q3543648) (← links)
- Ready,<tt>Set</tt>, Verify! Applying<tt>hs-to-coq</tt>to real-world Haskell code (Q5018778) (← links)
- (Q5111307) (← links)
- Automating Side Conditions in Formalized Partial Functions (Q5505512) (← links)
- Formalizing Bachmair and Ganzinger's ordered resolution prover (Q5919011) (← links)
