45 citations · 237 across the 53 of their papers we have counts for
74 papers
Nominal Automata with Name Deallocation
Simon Prucker, Stefan Milius, Lutz Schröder
Data words with binders formalize concurrently allocated memory. Most name-binding mechanisms in formal languages, such as the -calculus, adhere to properly nested scoping. In c…
A Unified Treatment of Substitution for Presheaves, Nominal Sets, Renaming Sets, and so on
Fabian Lenke, Stefan Milius, Henning Urbat
Presheaves and nominal sets provide alternative abstract models of sets of syntactic objects with free and bound variables, such as lambda-terms. One distinguishing feature of the…
Codensity Monads via Density and Duality
Fabian Lenke, Nico Wittrock, Stefan Milius +1
Codensity monads provide a universal method to generate complex monads from simple functors. Recently, a wide range of important monads in logic, denotational semantics, and probab…
Bialgebraic Reasoning on Stateful Languages
Sergey Goncharov, Stefan Milius, Lutz Schröder +2
Reasoning about program equivalence in imperative languages is notoriously challenging, as the presence of states (in the form of variable stores) fundamentally increases the obser…
Learning Automata with Name Allocation
Florian Frank, Stefan Milius, Jurriaan Rot +1
Automata over infinite alphabets have emerged as a convenient computational model for processing structures involving data, such as nonces in cryptographic protocols or data values…
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…