Towards logical foundations for probabilistic computation
DOI10.1016/j.apal.2023.103341MaRDI QIDQ6560995
Paolo Pistone, Melissa Antonelli, Ugo Dal Lago
Publication date: 24 June 2024
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
propositional logiccounting complexityprobabilistic computationcounting quantifierstyped \(\lambda \)-calculi
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Functional programming and lambda calculus (68N18) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Proof theory in general (including proof-theoretic semantics) (03F03)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An analysis of first-order logics of probability
- Combinatory logic. With two sections by William Craig.
- Lectures on the Curry-Howard isomorphism
- Games against nature
- Probabilistic logic
- The complexity of combinatorial problems with succinct input representation
- Some observations on the connection between counting and recursion
- Probabilistic quantifiers and games
- Semantics of probabilistic programs
- Bounded linear logic: A modular approach to polynomial-time computability
- The polynomial-time hierarchy
- Complete sets and the polynomial-time hierarchy
- A logic for reasoning about time and reliability
- A double category theoretic analysis of graded linear exponential comonads
- A logic for reasoning about probabilities
- On measure quantifiers in first-order arithmetic
- Decomposing probabilistic lambda calculi
- Markov logic networks
- Probabilistic logic revisited
- A theory of effects and resources: adjunction models and polarised calculi
- A modal analysis of staged computation
- PP is as Hard as the Polynomial-Time Hierarchy
- Reasoning with time and chance
- The measure quantifier
- Computational types from a logical perspective
- Reasoning about knowledge and probability
- On bunched typing
- Monadic Second Order Logic with Measure and Category Quantifiers
- A decisive characterization of BPP
- Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
- Propositions as sessions
- Measure Quantifier in Monadic Second Order Logic
- The geometry of parallelism: classical, probabilistic, and quantum effects
- Probabilistic coherence spaces are fully abstract for probabilistic PCF
- Parametric effect monads and semantics of effect systems
- Bounded Linear Types in a Resource Semiring
- A Core Quantitative Coeffect Calculus
- Probabilistic automata
- Probabilistic Turing Machines and Computability
- The complexity of theorem-proving procedures
- Linear logic propositions as session types
- Bounded Linear Logic, Revisited
- An ecumenical notion of entailment
- On counting propositional logic and Wagner's hierarchy
This page was built for publication: Towards logical foundations for probabilistic computation
