Program equivalence in a typed probabilistic call-by-need functional language

DOI10.1016/j.jlamp.2023.100904OpenAlexW4385860569MaRDI QIDQ6052951

David Sabel, Manfred Schmidt-Schauss

Publication date: 25 September 2023

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2023.100904

zbMATH Keywords

program transformationssemanticslambda-calculusprobabilistic programmingcall-by-need evaluation

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• On generic context lemmas for higher-order calculi with sharing
• An operational semantics of sharing in lazy evaluation
• LCF considered as a programming language
• From operational semantics to domain theory
• Probabilistic operational semantics for the lambda calculus
• Step-Indexed Logical Relations for Probability
• The call-by-need lambda calculus
• Foundations of Probabilistic Programming
• On Probabilistic λ-Calculi
• On coinductive equivalences for higher-order probabilistic functional programs
• On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Program equivalence in a typed probabilistic call-by-need functional language