Search

• < Previous
• 1
• Next >

---

Knowledge Spaces and the Completeness of Learning Strategies

Stefano Berardi ; Ugo de'Liguoro.

We propose a theory of learning aimed to formalize some ideas underlying Coquand's game semantics and Krivine's realizability of classical logic. We introduce a notion of knowledge state together with a new topology, capturing finite positive and negative information that guides a learning strategy.&nbsp;[&hellip;]

---

Retractability, games and orchestrators for session contracts

Franco Barbanera ; Ugo de'Liguoro.

Session contracts is a formalism enabling to investigate client/server interaction protocols and to interpret session types. We extend session contracts in order to represent outputs whose actual sending in an interaction depends on a third party or on a mutual agreement between the partners. Such&nbsp;[&hellip;]

---

Intersection Types for the lambda-mu Calculus

Steffen van Bakel ; Franco Barbanera ; Ugo de'Liguoro.

We introduce an intersection type system for the lambda-mu calculus that is invariant under subject reduction and expansion. The system is obtained by describing Streicher and Reus's denotational model of continuations in the category of omega-algebraic lattices via Abramsky's domain-logic approach.&nbsp;[&hellip;]

---

Mixin Composition Synthesis based on Intersection Types

Jan Bessai ; Tzu-Chun Chen ; Andrej Dudenhefner ; Boris Düdder ; Ugo de'Liguoro ; Jakob Rehof.

We present a method for synthesizing compositions of mixins using type inhabitation in intersection types. First, recursively defined classes and mixins, which are functions over classes, are expressed as terms in a lambda calculus with records. Intersection types with records and record-merge are&nbsp;[&hellip;]

---