:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Møgelberg, Rasmus Ejlers, Zwart, Maaike
Format:	Preprint
Published:	2023
Subjects:	Logic in Computer Science
Online Access:	https://arxiv.org/abs/2311.15919
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Multi-clocked Guarded Recursion Beyond ω
by: Møgelberg, Rasmus Ejlers
Published: (2025)

Induction and Recursion Principles in a Higher-Order Quantitative Logic for Probability
by: Bacci, Giorgio, et al.
Published: (2025)

Modelling Recursion and Probabilistic Choice in Guarded Type Theory
by: Stassen, Philipp Jan Andries, et al.
Published: (2024)

Correspondence between Composite Theories and Distributive Laws
by: Rosset, Aloïs, et al.
Published: (2024)

Monadic Second-Order Logic of Permutations
by: Jelínek, Vít, et al.
Published: (2025)

Distributive Laws of Monadic Containers
by: Purdy, Chris, et al.
Published: (2025)

The Monadic Theory of Toric Words
by: Berthé, Valérie, et al.
Published: (2023)

Separability Properties of Monadically Dependent Graph Classes
by: Bonnet, Édouard, et al.
Published: (2025)

On the Decidability of Monadic Theories of Arithmetic Predicates
by: Berthé, Valérie, et al.
Published: (2024)

Graded Monads and Behavioural Equivalence Games
by: Ford, Chase, et al.
Published: (2022)

From Partial to Monadic: Combinatory Algebra with Effects
by: Cohen, Liron, et al.
Published: (2025)

The Parameterized Complexity of Learning Monadic Second-Order Logic
by: van Bergerem, Steffen, et al.
Published: (2023)

Free Monads, Intrinsic Scoping, and Higher-Order Preunification
by: Kudasov, Nikolai
Published: (2022)

Representing Guardedness in Call-by-Value and Guarded Parametrized Monads
by: Goncharov, Sergey
Published: (2024)

Tape Diagrams for Monoidal Monads
by: Bonchi, Filippo, et al.
Published: (2025)

The Formal Theory of Monads, Univalently
by: van der Weide, Niels
Published: (2022)

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
by: Dreier, Jan, et al.
Published: (2024)

Handling the Selection Monad (Full Version)
by: Plotkin, Gordon, et al.
Published: (2025)

Stone Duality for Monads
by: Garner, Richard, et al.
Published: (2026)

A Practical Formalization of Monadic Equational Reasoning in Dependent-type Theory
by: Affeldt, Reynald, et al.
Published: (2023)

The Only Distributive Law Over the Powerset Monad Is the One You Know
by: Goncharov, Sergey, et al.
Published: (2026)

Monadic Intersection Types, Relationally (Extended Version)
by: Gavazzo, Francesco, et al.
Published: (2024)

Datalog-Expressibility for Monadic and Guarded Second-Order Logic
by: Bodirsky, Manuel, et al.
Published: (2020)

Smart Choices and the Selection Monad
by: Abadi, Martin, et al.
Published: (2020)

Monads and Distributive Laws in Substructural Contexts (Extended Version)
by: Fujii, Soichiro, et al.
Published: (2026)

Demystifying Codensity Monads via Duality
by: Lenke, Fabian, et al.
Published: (2025)

Symmetric Linear Arc Monadic Datalog and Gadget Reductions
by: Bodirsky, Manuel, et al.
Published: (2024)

Beyond Monads and Biproducts: A Uniform Interpretation of Parallelism in Intuitionistic Logic
by: Díaz-Caro, Alejandro, et al.
Published: (2024)

Strong Dinatural Transformations and Generalised Codensity Monads
by: Piróg, Maciej, et al.
Published: (2025)

Characterizations of Monadic Second Order Definable Context-Free Sets of Graphs
by: Iosif, Radu, et al.
Published: (2023)

Characterizing Sets of Theories That Can Be Disjointly Combined
by: Przybocki, Benjamin, et al.
Published: (2025)

On Deciding the Data Complexity of Answering Linear Monadic Datalog Queries with LTL Operators(Extended Version)
by: Artale, Alessandro, et al.
Published: (2025)

Why Cannot Large Language Models Ever Make True Correct Reasoning?
by: Cheng, Jingde
Published: (2025)

Graded Monad Coalgebras for Continuous-Time Transition Systems
by: Di Lavore, Elena, et al.
Published: (2026)

Model Checking for Reinforcement Learning in Autonomous Driving: One Can Do More Than You Think!
by: Gu, Rong
Published: (2024)

The Varieties of Ought-Implies-Can and Deontic STIT Logic
by: van Berkel, Kees, et al.
Published: (2026)

Large Lemma Miners: Can LLMs do Induction Proofs for Hardware?
by: Peled, Romy, et al.
Published: (2025)

The Complexity of Games with Randomised Control
by: Bahmani, Sarvin, et al.
Published: (2026)

When Do You Start Counting? Revisiting Counting and Pnueli Modalities in Timed Logics
by: Ho, Hsi-Ming, et al.
Published: (2024)

Growing a Modular Framework for Modal Systems- HOLMS: a HOL Light Library
by: Bilotta, Antonella
Published: (2025)