Pages that link to "Item:Q3618814"
From MaRDI portal
The following pages link to Proofs of Randomized Algorithms in Coq (Q3618814):
Displaying 8 items.
- Reasoning about conditional probabilities in a higher-order-logic theorem prover (Q545151) (← links)
- Proofs of randomized algorithms in Coq (Q923886) (← links)
- Using theorem proving to verify expectation and variance for discrete random variables (Q1040780) (← links)
- Program logic for higher-order probabilistic programs in Isabelle/HOL (Q2163157) (← links)
- Probabilistic operational semantics for the lambda calculus (Q2905328) (← links)
- Some Domain Theory and Denotational Semantics in Coq (Q3183523) (← links)
- A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq (Q3638257) (← links)
- Synthetic topology in Homotopy Type Theory for probabilistic programming (Q5055499) (← links)
