39 citations · 146 across the 23 of their papers we have counts for
4 papers · 1 filter
Natural Transformations as Rewrite Rules and Monad Composition
Dexter Kozen
Eklund et al. (2002) present a graphical technique aimed at simplifying the verification of various category-theoretic constructions, notably the composition of monads. In this not…
On Free -Continuous and Regular Ordered Algebras
Zoltan Esik, Dexter Kozen
We study varieties of certain ordered -algebras with restricted completeness and continuity properties. We give a general characterization of their free algebras in terms of sub…
Cantor meets Scott: Semantic Foundations for Probabilistic Networks
Steffen Smolka, Praveen Kumar, Nate Foster +2
ProbNetKAT is a probabilistic extension of NetKAT with a denotational semantics based on Markov kernels. The language is expressive enough to generate continuous distributions, whi…
Nominal Automata with Name Binding
Lutz Schröder, Dexter Kozen, Stefan Milius +1
Automata models for data languages (i.e. languages over infinite alphabets) often feature either global or local freshness operators. We show that Bollig et al.'s session automata,…