Interpreting Lambda Calculus in Domain-Valued Random Variables

12/12/2021
by   Robert Furber, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/23/2019

A formalization of forcing and the unprovability of the continuum hypothesis

We describe a formalization of forcing using Boolean-valued models in th...
research
10/14/2018

Monads, partial evaluations, and rewriting

Monads can be interpreted as encoding formal expressions, or formal oper...
research
11/23/2022

A Calculus for Amortized Expected Runtimes

We develop a weakest-precondition-style calculus à la Dijkstra for reaso...
research
05/03/2019

A Constructive Proof of a Concentration Bound for Real-Valued Random Variables

Almost 10 years ago, Impagliazzo and Kabanets (2010) gave a new combinat...
research
06/18/2018

Boolean-like algebras of finite dimension

We introduce Boolean-like algebras of dimension n (nBA) having n constan...
research
07/27/2017

Non-Count Symmetries in Boolean & Multi-Valued Prob. Graphical Models

Lifted inference algorithms commonly exploit symmetries in a probabilist...
research
01/21/2020

Bisimilar Conversion of Multi-valued Networks to Boolean Networks

Discrete modelling frameworks of Biological networks can be divided in t...

Please sign up or login with your details

Forgot password? Click here to reset