11 papers
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…
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…
Towards a Higher-Order Mathematical Operational 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…
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…
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…
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…