11 citations · 36 across the 25 of their papers we have counts for
8 papers · 1 filter
Abstract Operational Methods for Call-by-Push-Value
Sergey Goncharov, Stelios Tsampas, Henning Urbat
Levy's call-by-push-value is a comprehensive programming paradigm that combines elements from functional and imperative programming, supports computational effects and subsumes bot…
Algebraic Language Theory with Effects
Fabian Lenke, Stefan Milius, Henning Urbat +1
Regular languages -- the languages accepted by deterministic finite automata -- are known to be precisely the languages recognized by finite monoids. This characterization is the o…
Alternating Nominal Automata with Name Allocation
Florian Frank, Daniel Hausmann, Stefan Milius +2
Formal languages over infinite alphabets serve as abstractions of structures and processes carrying data. Automata models over infinite alphabets, such as classical register automa…
Higher-order bialgebraic semantics
Sergey Goncharov, Stefan Milius, Lutz Schröder +2
Compositionality proofs in higher-order languages are notoriously involved, and general semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi a…
Bialgebraic Reasoning on Higher-Order Program Equivalence
Sergey Goncharov, Stefan Milius, Stelios Tsampas +1
Logical relations constitute a key method for reasoning about contextual equivalence of programs in higher-order languages. They are usually developed on a per-case basis, with a n…
Logical Predicates in Higher-Order Mathematical Operational Semantics
Sergey Goncharov, Alessio Santamaria, Lutz Schröder +2
We present a systematic approach to logical predicates based on universal coalgebra and higher-order abstract GSOS, thus making a first step towards a unifying theory of logical re…
Algebraic Reasoning over Relational Structures
Jan Jurka, Stefan Milius, Henning Urbat
Many important computational structures involve an intricate interplay between algebraic features (given by operations on the underlying set) and relational features (taking accoun…
Extended Stone Duality via Monoidal Adjunctions
Fabian Lenke, Henning Urbat, Stefan Milius
Extensions of Stone-type dualities have a long history in algebraic logic and have also been instrumental in proving results in algebraic language theory. We show how to extend abs…