We give two concrete examples of continuous valuations on dcpo’s to separate minimal valuations, point-continuous valuations, and continuous valuations:

1. (1) Let ${\mathcal J}$ be the Johnstone’s non-sober dcpo, and μ be the continuous valuation on ${\mathcal J}$ with μ(U)=1 for nonempty Scott opens U and μ(U)=0 for $U=\emptyset$. Then, μ is a point-continuous valuation on ${\mathcal J}$ that is not minimal.

2. (2) Lebesgue measure extends to a measure on the Sorgenfrey line $\mathbb{R}_\ell$. Its restriction to the open subsets of $\mathbb{R}_\ell$ is a continuous valuation λ. Then, its image valuation $\overline\lambda$ through the embedding of $\mathbb{R}_\ell$ into its Smyth powerdomain $\mathcal{Q}\mathbb{R}_\ell$ in the Scott topology is a continuous valuation that is not point-continuous.

We believe that our construction $\overline\lambda$ might be useful in giving counterexamples displaying the failure of the general Fubini-type equations on dcpo’s.

We give two geometry of interaction models for a typed λ-calculus with recursion endowed with operators for sampling from a continuous uniform distribution and soft conditioning, namely a paradigmatic calculus for higher-order Bayesian programming. The models are based on the category of measurable spaces and partial measurable functions, and the category of measurable spaces and s-finite kernels, respectively. The former is proved adequate with respect to both a distribution-based and a sampling-based operational semantics, while the latter is proved adequate with respect to a sampling-based operational semantics.

Guided by Tarksi’s fixpoint theorem in order theory, we show how to derive monotone recursive types with constant-time roll and unroll operations within Cedille, an impredicative, constructive, and logically consistent pure typed lambda calculus. This derivation takes place within the preorder on Cedille types induced by type inclusions, a notion which is expressible within the theory itself. As applications, we use monotone recursive types to generically derive two recursive representations of data in lambda calculus, the Parigot and Scott encoding. For both encodings, we prove induction and examine the computational and extensional properties of their destructor, iterator, and primitive recursor in Cedille. For our Scott encoding in particular, we translate into Cedille a construction due to Lepigre and Raffalli (2019) that equips Scott naturals with primitive recursion, then extend this construction to derive a generic induction principle. This allows us to give efficient and provably unique (up to function extensionality) solutions for the iteration and primitive recursion schemes for Scott-encoded data.