The following pages link to Lutz Schröder (Q234493):
Displaying 50 items.
- Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets (Q328657) (← links)
- A coinductive calculus for asynchronous side-effecting processes (Q393094) (← links)
- Quantitative Kleene coalgebras (Q532394) (← links)
- The \({\mathcal {HS}} = {\mathcal {SH}}\) problem for coalgebras (Q607460) (← links)
- Cut elimination in coalgebraic logics (Q618171) (← links)
- Coequational logic for accessible functors (Q618173) (← links)
- On second-order iterative monads (Q639639) (← links)
- Maximal traces and path-based coalgebraic temporal logics (Q639645) (← links)
- Bialgebras for structural operational semantics: an introduction (Q639646) (← links)
- A coalgebraic approach to the semantics of the ambient calculus (Q860882) (← links)
- Linearizability of non-expansive semigroup actions on metric spaces (Q935259) (← links)
- A generic complete dynamic logic for reasoning about purity and effects (Q973056) (← links)
- HasCasl: integrated higher-order specification and program development (Q1006648) (← links)
- Coalgebraic logic for stochastic right coalgebras (Q1023291) (← links)
- Stochastic coalgebraic logic (Q1049890) (← links)
- Free adjunction of morphisms (Q1592940) (← links)
- Monads on composition graphs (Q1610278) (← links)
- Guarded traced categories (Q1652996) (← links)
- Globalization of confluent partial actions on topological and metric spaces (Q1764665) (← links)
- Amalgamation in the semantics of CASL (Q1770431) (← links)
- Predicate liftings and functor presentations in coalgebraic expression languages (Q1798785) (← links)
- From generic partition refinement to weighted tree automata minimization (Q1982644) (← links)
- Quasipolynomial computation of nested fixpoints (Q2044189) (← links)
- NP reasoning in the monotone \(\mu\)-calculus (Q2096471) (← links)
- Explaining non-bisimilarity in a coalgebraic approach: games and distinguishing formulas (Q2229232) (← links)
- A quantified coalgebraic van Benthem theorem (Q2233433) (← links)
- Optimal satisfiability checking for arithmetic \(\mu\)-calculi (Q2289080) (← links)
- Permutation games for the weakly aconjunctive \(\mu \)-calculus (Q2324236) (← links)
- The HASCASL prologue: Categorical syntax and semantics of the partial \(\lambda\)-calculus (Q2368980) (← links)
- Algebraic-coalgebraic specification in CoCASL (Q2369034) (← links)
- Combining machine learning and semantic features in the classification of corporate disclosures (Q2425335) (← links)
- Expressivity of coalgebraic modal logic: the limits and beyond (Q2474056) (← links)
- A finite model construction for coalgebraic modal logic (Q2643335) (← links)
- (Q2722021) (← links)
- (Q2752011) (← links)
- (Q2764130) (← links)
- Classifying categories for partial equational logic (Q2842828) (← links)
- \textsc{CoCasl} at work -- modelling process algebra (Q2843729) (← links)
- Exploring the boundaries of monad tensorability on Set (Q2848367) (← links)
- Simulations and Bisimulations for Coalgebraic Modal Logics (Q2848953) (← links)
- Admissibility of cut in coalgebraic logics (Q2873670) (← links)
- Kleene Monads: Handling Iteration in a Framework of Generic Effects (Q2888474) (← links)
- Narcissists Are Easy, Stepmothers Are Hard (Q2892774) (← links)
- Strongly complete logics for coalgebras (Q2914235) (← links)
- PSPACE bounds for rank-1 modal logics (Q2946571) (← links)
- Reasoning with Global Assumptions in Arithmetic Modal Logics (Q2947894) (← links)
- Probabilistic Description Logics for Subjective Uncertainty (Q2953940) (← links)
- A Van Benthem/Rosen theorem for coalgebraic predicate logic (Q2983396) (← links)
- Nominal Automata with Name Binding (Q2988364) (← links)
- Unifying Guarded and Unguarded Iteration (Q2988389) (← links)
