Towards logical foundations for probabilistic computation
From MaRDI portal
counting complexitycounting quantifiersprobabilistic computationpropositional logictyped \(\lambda \)-calculi
Complexity of computation (including implicit computational complexity) (03D15) Proof theory in general (including proof-theoretic semantics) (03F03) Functional programming and lambda calculus (68N18) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites work
- A core quantitative coeffect calculus
- A decisive characterization of BPP
- A double category theoretic analysis of graded linear exponential comonads
- A logic for reasoning about probabilities
- A logic for reasoning about time and reliability
- A modal analysis of staged computation
- A theory of effects and resources: adjunction models and polarised calculi
- An analysis of first-order logics of probability
- An ecumenical notion of entailment
- Bounded Linear Logic, Revisited
- Bounded linear logic: A modular approach to polynomial-time computability
- Bounded Linear Types in a Resource Semiring
- Combinatory logic. With two sections by William Craig.
- Complete sets and the polynomial-time hierarchy
- Computational types from a logical perspective
- Decomposing probabilistic lambda calculi
- Games against nature
- scientific article; zbMATH DE number 3883612 (Why is no real title available?)
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 3521950 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 3557236 (Why is no real title available?)
- scientific article; zbMATH DE number 1324438 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 722611 (Why is no real title available?)
- scientific article; zbMATH DE number 2046116 (Why is no real title available?)
- scientific article; zbMATH DE number 2134919 (Why is no real title available?)
- scientific article; zbMATH DE number 1848312 (Why is no real title available?)
- scientific article; zbMATH DE number 2090077 (Why is no real title available?)
- Lectures on the Curry-Howard isomorphism
- Linear logic propositions as session types
- Markov logic networks
- Measure quantifier in monadic second order logic
- Monadic Second Order Logic with Measure and Category Quantifiers
- On bunched typing
- On counting propositional logic and Wagner's hierarchy
- On measure quantifiers in first-order arithmetic
- Parametric effect monads and semantics of effect systems
- PP is as Hard as the Polynomial-Time Hierarchy
- Probabilistic automata
- Probabilistic call by push value
- Probabilistic coherence spaces are fully abstract for probabilistic PCF
- Probabilistic logic
- Probabilistic logic revisited
- Probabilistic logics based on Riesz spaces
- Probabilistic quantifiers and games
- Probabilistic Turing Machines and Computability
- Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
- Propositions as sessions
- Reasoning about knowledge and probability
- Reasoning with time and chance
- Semantics of probabilistic programs
- Some observations on the connection between counting and recursion
- The complexity of combinatorial problems with succinct input representation
- The complexity of theorem-proving procedures
- The geometry of parallelism: classical, probabilistic, and quantum effects
- The measure quantifier
- The polynomial-time hierarchy
This page was built for publication: Towards logical foundations for probabilistic computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560995)
