Solvability in a probabilistic setting (invited talk)
From MaRDI portal
Cites work
- A probabilistic and non-deterministic call-by-push-value language
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Essential and relational models
- Execution time of λ-terms via denotational semantics and intersection types
- Fully abstract models of the probabilistic -calculus
- scientific article; zbMATH DE number 3615887 (Why is no real title available?)
- scientific article; zbMATH DE number 1231645 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- Lambda calculus and probabilistic computation
- On coinductive equivalences for higher-order probabilistic functional programs
- On probabilistic term rewriting
- Probabilistic Böhm trees and probabilistic separation
- Probabilistic coherence spaces are fully abstract for probabilistic PCF
- Probabilistic coherence spaces as a model of higher-order probabilistic computation
- Probabilistic operational semantics for the lambda calculus
- Probabilistic -calculus and Quantitative Program Analysis
- Stochastic lambda calculus and monads of probability distributions
- Strong adequacy and untyped full-abstraction for probabilistic coherence spaces
- The algebraic lambda calculus
- The differential lambda-calculus
- The discriminating power of the let-in operator in the lazy call-by-name probabilistic \(\lambda\)-calculus
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The parametric lambda calculus. A metamodel for computation.
- Type-based complexity analysis of probabilistic functional programs
- Weighted relational models of typed lambda-calculi
This page was built for publication: Solvability in a probabilistic setting (invited talk)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6854435)
