Probabilistic -calculus and Quantitative Program Analysis

DOI10.1093/LOGCOM/EXI008MaRDI QIDQ3025332zbMATH OpenOpenAlexFDO

Authors Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky

Publication date 13 July 2005

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exi008

zbMATH Keywords

Lambda calculusprobabilistic abstract interpretationprogram analysis

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Recommendations

• -calculus and quantitative program analysis (extended abstract)
• A probabilistic semantics for the pure \(\lambda\)-calculus
• Probabilistic operational semantics for the lambda calculus
• scientific article; zbMATH DE number 1617330
• On probabilistic techniques for data flow analysis

Cited in

(30)

• A probabilistic semantics for the pure \(\lambda\)-calculus
• Probabilistic reasoning about simply typed lambda terms
• Decomposing probabilistic lambda calculi
• Refinement algebra for probabilistic programs
• Confluence in probabilistic rewriting
• Measurements and confluence in quantum lambda calculi with explicit qubits
• Scalar System F for linear-algebraic -calculus: towards a quantum physical logic
• Confluence results for a quantum lambda calculus with measurements
• -calculus and quantitative program analysis (extended abstract)
• Probabilistic -calculus and event structures
• Probabilistic operational semantics for the lambda calculus
• scientific article; zbMATH DE number 6712184 (Why is no real title available?)
• A lambda-calculus foundation for universal probabilistic programming
• A Type Theory for Probabilistic \lambda –calculus
• Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
• Long-run cost analysis by approximation of linear operators over dioids
• scientific article; zbMATH DE number 2086512 (Why is no real title available?)
• Probabilistic rewriting: normalization, termination, and unique normal forms
• Probabilistic rewriting and asymptotic behaviour: on termination and unique normal forms
• A deterministic rewrite system for the probabilistic \(\lambda\)-calculus
• Boolean-valued semantics for the stochastic \(\lambda \)-calculus
• Stochastic lambda calculus and monads of probability distributions
• Approximate Counting in SMT and Value Estimation for Probabilistic Programs
• The vectorial \(\lambda\)-calculus
• Probabilistic coherence spaces as a model of higher-order probabilistic computation
• Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language
• Lambda calculus and probabilistic computation
• Solvability in a probabilistic setting (invited talk)
• A rewriting theory for quantum -calculus
• A logic of knowledge and justifications, with an application to computational trust

This page was built for publication: Probabilistic  -calculus and Quantitative Program Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3025332)