(Towards a) statistical probabilistic lazy lambda calculus

DOI10.1007/978-3-031-24117-8_28MaRDI QIDQ6612804zbMATH OpenFDO

Authors Radha Jagadeesan

Publication date 1 October 2024

Full work available at URL https://doi.org/10.1007/978-3-031-24117-8_28

zbMATH Keywords

lambda calculusopen bisimulationprobabilitysemantics

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx) Quantum computation (81P68)

Cites work

• A Complete, Co-inductive Syntactic Theory of Sequential Control and State
• A Convenient Category for Higher-Order Probability Theory
• A domain equation for bisimulation
• A trace semantics for System F parametric polymorphism
• Approximating labelled Markov processes
• Characterising Testing Preorders for Finite Probabilistic Processes
• Coinduction All the Way Up
• Computation on metric spaces via domain theory
• Domain theory in logical form
• Environmental bisimulations for probabilistic higher-order languages
• Fooling the Parallel or Tester with Probability 8/27
• Full abstraction for PCF
• Full abstraction in the lazy lambda calculus
• scientific article; zbMATH DE number 4179422 (Why is no real title available?)
• scientific article; zbMATH DE number 3706504 (Why is no real title available?)
• scientific article; zbMATH DE number 4123722 (Why is no real title available?)
• scientific article; zbMATH DE number 1231459 (Why is no real title available?)
• scientific article; zbMATH DE number 1231645 (Why is no real title available?)
• scientific article; zbMATH DE number 1330448 (Why is no real title available?)
• scientific article; zbMATH DE number 1956514 (Why is no real title available?)
• scientific article; zbMATH DE number 1499102 (Why is no real title available?)
• scientific article; zbMATH DE number 794262 (Why is no real title available?)
• Labelled Markov processes.
• Lazy lambda calculus: theories, models and local structure characterization (extended abstract)
• Metrics for labelled Markov processes
• New foundations for the geometry of interaction
• On full abstraction for PCF: I, II and III
• Open Bisimulation for Aspects
• Probabilistic coherence spaces are fully abstract for probabilistic PCF
• Probabilistic coherence spaces as a model of higher-order probabilistic computation
• Probabilistic game semantics
• The lazy lambda calculus in a concurrency scenario
• The Max-Flow Min-Cut theorem for countable networks
• Transition systems over games

This page was built for publication: (Towards a) statistical probabilistic lazy lambda calculus

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