(Towards a) statistical probabilistic lazy lambda calculus

DOI10.1007/978-3-031-24117-8_28MaRDI QIDQ6612804

Radha Jagadeesan

Publication date: 1 October 2024

zbMATH Keywords

probabilitysemanticslambda calculusopen bisimulation

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic coherence spaces as a model of higher-order probabilistic computation
• Metrics for labelled Markov processes
• The Max-Flow Min-Cut theorem for countable networks
• Domain theory in logical form
• Full abstraction in the lazy lambda calculus
• Computation on metric spaces via domain theory
• New foundations for the geometry of interaction
• The lazy lambda calculus in a concurrency scenario
• Approximating labelled Markov processes
• A trace semantics for System F parametric polymorphism
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• A domain equation for bisimulation
• Environmental bisimulations for probabilistic higher-order languages
• A Complete, Co-inductive Syntactic Theory of Sequential Control and State
• Characterising Testing Preorders for Finite Probabilistic Processes
• Open Bisimulation for Aspects
• Transition systems over games
• Coinduction All the Way Up
• A Convenient Category for Higher-Order Probability Theory
• Lazy Lambda calculus: Theories, models and local structure characterization
• Probabilistic coherence spaces are fully abstract for probabilistic PCF
• Probabilistic game semantics
• Fooling the Parallel or Tester with Probability 8/27

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