Recommendations
Cited in
(42)- Complexity bounds for container functors and comonads
- Undecidability of equality for codata types
- Differential structure, tangent structure, and SDG
- Relative full completeness for bicategorical Cartesian closed structure
- Reverse AD at higher types: pure, principled and denotationally correct
- Interfaces as functors, programs as coalgebras -- a final coalgebra theorem in intensional type theory
- Containers: Constructing strictly positive types
- Continuous functions on final coalgebras
- Constructive membership predicates as index types
- Proving properties about functions on lists involving element tests
- Data types with symmetries and polynomial functors over groupoids
- Formalizing semantic bidirectionalization and extensions with dependent types
- Higher-order containers
- Derivatives of containers
- Container types categorically
- scientific article; zbMATH DE number 6981655 (Why is no real title available?)
- Notions of computation as monoids
- Constructing higher inductive types as groupoid quotients
- Dependent inductive and coinductive types are fibrational dialgebras
- Compositional game theory, compositionally
- Combining predicate transformer semantics for effects: a case study in parsing regular languages
- Multi-dimensional arrays with levels
- Coherence for bicategorical cartesian closed structure
- Monotone recursive types and recursive data representations in Cedille
- A representation theorem for second-order functionals
- Indexed containers
- Interactive programming in Agda -- objects and graphical user interfaces
- Container model
- scientific article; zbMATH DE number 7649955 (Why is no real title available?)
- Monad transformers as monoid transformers
- Characterizing functions mappable over GADTs
- Hefty algebras: modular elaboration of higher-order effects
- Reverse tangent categories
- Weihrauch problems as containers
- Comodule representations of second-order functionals
- No go theorems: directed containers that do not distribute over distribution monads
- Functorial aggregation
- Data types with symmetries via action containers
- Distributive laws of monadic containers
- Formalising inductive and coinductive containers
- Free doubly-infinitary distributive categories are Cartesian closed
- The list object endofunctor is polynomial
This page was built for publication: Categories of containers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4417849)
