The following pages link to (Q4179849):
Displayed 16 items.
- Computable de Finetti measures (Q764273) (← links)
- Using information systems to solve recursive domain equations (Q808273) (← links)
- CPO's of measures for nondeterminism (Q1139367) (← links)
- Approximating labelled Markov processes (Q1398379) (← links)
- Decomposing probabilistic lambda calculi (Q2200818) (← links)
- Densities of almost surely terminating probabilistic programs are differentiable almost everywhere (Q2233472) (← links)
- Bisimulation for labelled Markov processes (Q2506488) (← links)
- Least upper bounds for probability measures and their applications to abstractions (Q2637319) (← links)
- Metric Reasoning About $$\lambda $$-Terms: The General Case (Q2988646) (← links)
- (Q5028447) (← links)
- (Q5089021) (← links)
- (Q5094133) (← links)
- (Q5129945) (← links)
- Program equivalence in a typed probabilistic call-by-need functional language (Q6052951) (← links)
- The probabilistic termination tool amber (Q6145021) (← links)
- Foundations for entailment checking in quantitative separation logic (Q6166785) (← links)