Search

• < Previous
• 1
• Next >

---

On the characterization of models of H*: The semantical aspect

Flavien Breuvart.

We give a characterization, with respect to a large class of models of untyped lambda-calculus, of those models that are fully abstract for head-normalization, i.e., whose equational theory is H* (observations for head normalization). An extensional K-model $D$ is fully abstract if and only if it is&nbsp;[&hellip;]

---

Relational Graph Models at Work

Flavien Breuvart ; Giulio Manzonetto ; Domenico Ruoppolo.

We study the relational graph models that constitute a natural subclass of relational models of lambda-calculus. We prove that among the lambda-theories induced by such models there exists a minimal one, and that the corresponding relational graph model is very natural and easy to construct. We then&nbsp;[&hellip;]

---

On Higher-Order Probabilistic Subrecursion

Flavien Breuvart ; Ugo Dal Lago ; Agathe Herrou.

We study the expressive power of subrecursive probabilistic higher-order calculi. More specifically, we show that endowing a very expressive deterministic calculus like G\"odel's $\mathbb{T}$ with various forms of probabilistic choice operators may result in calculi which are not equivalent as for&nbsp;[&hellip;]

---