Interpreting Lambda Calculus in Domain-Valued Random Variables
Logic in Computer Science
2026-01-06 v2
Abstract
We develop Boolean-valued domain theory and show how the lambda-calculus can be interpreted in using domain-valued random variables. We focus on the reflexive domain construction rather than the language and its semantics. The notion of equality has to be interpreted in the Boolean algebra and when we say that an equation is valid in the model we mean that its interpretation is the top element of the Boolean algebra.
Cite
@article{arxiv.2112.06339,
title = {Interpreting Lambda Calculus in Domain-Valued Random Variables},
author = {Robert Furber and Radu Mardare and Prakash Panangaden and Dana Scott},
journal= {arXiv preprint arXiv:2112.06339},
year = {2026}
}
Comments
31 pages, no figures, accepted by CSL 2026