scientific article; zbMATH DE number 3615887
From MaRDI portal
Publication:4179849
Cited in
(20)- CPO's of measures for nondeterminism
- Approximating labelled Markov processes
- Decomposing probabilistic lambda calculi
- Densities of almost surely terminating probabilistic programs are differentiable almost everywhere
- Bisimulation for labelled Markov processes
- Least upper bounds for probability measures and their applications to abstractions
- Metric reasoning about -terms: the general case
- On higher-order probabilistic subrecursion
- Probabilistic rewriting: normalization, termination, and unique normal forms
- Probabilistic rewriting and asymptotic behaviour: on termination and unique normal forms
- On the termination problem for probabilistic higher-order recursive programs
- Program equivalence in a typed probabilistic call-by-need functional language
- The probabilistic termination tool amber
- Foundations for entailment checking in quantitative separation logic
- Generative Datalog with continuous distributions
- From innermost to full almost-sure termination of probabilistic term rewriting
- Solvability in a probabilistic setting (invited talk)
- A distribution semantics for probabilistic term rewriting
- Computable de Finetti measures
- Using information systems to solve recursive domain equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4179849)
