Search

• < Previous
• 1
• Next >

---

Nominal Coalgebraic Data Types with Applications to Lambda Calculus

Alexander Kurz ; Daniela Luan Petrişan ; Paula Severi ; Fer-Jan de Vries.

We investigate final coalgebras in nominal sets. This allows us to define types of infinite data with binding for which all constructions automatically respect alpha equivalence. We give applications to the infinitary lambda calculus.

---

Automata Minimization: a Functorial Approach

Thomas Colcombet ; Daniela Petrişan.

In this paper we regard languages and their acceptors - such as deterministic or weighted automata, transducers, or monoids - as functors from input categories that specify the type of the languages and of the machines to categories that specify the type of outputs. Our results are as follows: A)&nbsp;[&hellip;]

---

Relation lifting, with an application to the many-valued cover modality

Marta Bilkova ; Alexander Kurz ; Daniela Petrisan ; Jiri Velebil.

We introduce basic notions and results about relation liftings on categories enriched in a commutative quantale. We derive two necessary and sufficient conditions for a 2-functor T to admit a functorial relation lifting: one is the existence of a distributive law of T over the "powerset monad" on&nbsp;[&hellip;]

---