Countable Lawvere theories and computational effects
From MaRDI portal
Publication:2863882
Recommendations
- Computability-Theoretic Complexity of Countable Structures
- Lawvere-Tierney topologies for computability theorists
- Enumerations, countable structures and Turing degrees
- Enumerations in computable structure theory
- The countable versus uncountable branching recurrences in computability logic
- scientific article; zbMATH DE number 1163992
- Computability on the countable ordinals and the Hausdorff-Kuratowski theorem (extended abstract)
- Toward a Theory of Enumerations
- A logical characterization of the counting hierarchy
Cited in
(17)- Dependent types and fibred computational effects
- Equational theories and monads from polynomial Cayley representations
- Algebra and Coalgebra in Computer Science
- Pseudo-distributive laws and axiomatics for variable binding
- Lawvere categories as composed PROPs
- Discrete Lawvere theories and computational effects
- Gabriel–Ulmer duality and Lawvere theories enriched over a general base
- Generic models for computational effects
- Indexed Lawvere theories for local state
- Sweedler theory of monads
- Graded algebraic theories
- The category theoretic understanding of universal algebra: Lawvere theories and monads
- Computational effects and operations: an overview
- From comodels to coalgebras: state and arrays
- String diagram rewrite theory II: Rewriting with symmetric monoidal structure
- The costructure–cosemantics adjunction for comodels for computational effects
- Towards Effects in Mathematical Operational Semantics
This page was built for publication: Countable Lawvere theories and computational effects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2863882)