Step-Indexed Logical Relations for Probability

DOI10.1007/978-3-662-46678-0_18zbMath1459.68031arXiv1501.02623OpenAlexW3106280144MaRDI QIDQ2949445

Aleš Bizjak, Lars Birkedal

Publication date: 1 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.02623

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

On the Versatility of Open Logical Relations, On bisimilarity in lambda calculi with continuous probabilistic choice, Program equivalence in a typed probabilistic call-by-need functional language, Unnamed Item, Metric Reasoning About $$\lambda $$-Terms: The General Case, Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring, Effectful applicative similarity for call-by-name lambda calculi