Pages that link to "Item:Q4561511"
From MaRDI portal
The following pages link to Full Abstraction for Probabilistic PCF (Q4561511):
Displaying 22 items.
- Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases (Q478400) (← links)
- Probabilistic coherence spaces as a model of higher-order probabilistic computation (Q550253) (← links)
- Taylor expansion, finiteness and strategies (Q2133165) (← links)
- Weighted models for higher-order computation (Q2216134) (← links)
- Densities of almost surely terminating probabilistic programs are differentiable almost everywhere (Q2233472) (← links)
- QPCF: higher-order languages and quantum circuits (Q2331073) (← links)
- Relating full abstraction results for different programming languages (Q3976061) (← links)
- Full abstraction, totality and PCF (Q4237906) (← links)
- (Q4281476) (← links)
- (Q4611384) (← links)
- Linear logic in normed cones: probabilistic coherence spaces and beyond (Q5076387) (← links)
- The geometry of Bayesian programming (Q5076392) (← links)
- On the Taylor expansion of probabilistic λ-terms (Q5089013) (← links)
- (Q5089018) (← links)
- (Q5089028) (← links)
- (Q5101335) (← links)
- (Q5140265) (← links)
- A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces (Q6145528) (← links)
- A coherent differential PCF (Q6178673) (← links)
- Abstraction-Refinement for Hierarchical Probabilistic Models (Q6487314) (← links)
- Zeta functions and the (linear) logic of Markov processes (Q6597969) (← links)
- Concrete categories and higher-order recursion. With applications including probability, differentiability, and full abstraction (Q6649494) (← links)
