Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 8 of 8 for “"Comonad"”.
-
Arboreal covers over relational structures
… satisfy the same sentences in a logic. Game comonads encode particular model comparison games as comonads on the categories of structures. This started with the work of Abramsky, Dawar, and Wang in 2017 on encoding pebble games for finite variable logics. Since this initial work, several …
-
A small presentation for Morava E-theory power operations
… also define and explore a notion of coquadratic comonad.
-
Fibred models of dual-context type theory and Kripke-Joyal forcing
… is a specific presheaf topos with an idempotent comonad; we show that any category C with an idempotent comonad admits a fibred natural model of dual-context type theory. To move to a style of semantics more convenient for later applications, we show that if C has a classifier of a stable class …
-
Combinatorial presentations of string diagrams for non-symmetric monoidal categories
… can be implemented, and establish a context comonad structure not just for plane graphs but for a much larger class of tree-like data types.
-
Semantics for Secure Software
… on those that can be given a semantics via a comonad. We compare three methods for combining these two popular options: one method requires extra semantic structure, whereas the other methods can be applied to any monadic and comonadic effects. If the extra semantic structure needed for the …
-
Interactions of (co)monads in Agda
We study interaction laws of monads and comonads in the interactive theorem prover Agda. Effectful computations are modeled as monads, while comonads model computation-running machines. Interaction laws describe how computations may be uniformly run to yield values. We study monads and comonads on …
-
Rectifying stable infinity-categories and relative koszul duality for operads
… algebras equipped with a coaction of the comonad arising from the adjunction between associative and commutative algebras. This provides a Koszul dual description of connected derived commutator (or NC) complete associative algebras and furthermore may be interpreted as a theory of …
-
Semantics for a higher-order functional programming language for quantum computation
… where the duplication is considered as a comonad with specific properties. The resulting model is what we call a linear category for duplication. Finally, we only focus on the fragment of the language that contains the aforementioned elements, and remove the classical Boolean and quantum …