45 citations · 237 across the 53 of their papers we have counts for
41 papers · 1 filter
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…
Initial Algebras Unchained -- A Novel Initial Algebra Construction Formalized in Agda
Thorsten Wißmann, Stefan Milius
The initial algebra for an endofunctor F provides a recursion and induction scheme for data structures whose constructors are described by F. The initial-algebra construction by Ad…
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…
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…