scientific article; zbMATH DE number 426302
From MaRDI portal
Publication:3137150
Data structures (68P05) Grammars and rewriting systems (68Q42) Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Eilenberg-Moore and Kleisli constructions for monads (18C20) Abstract data types; algebraic specification (68Q65) Fibered categories (18D30) Embedding theorems, universal categories (18B15) Actions of a monoidal category, tensorial strength (18D25)
Recommendations
Cited in
(20)- Coalgebras as types determined by their elimination rules
- Decomposing typed lambda calculus into a couple of categorical programming languages
- The Recursion Scheme from the Cofree Recursive Comonad
- Protocol choice and iteration for the free cornering
- Shortcut fusion rules for the derivation of circular and higher-order programs
- scientific article; zbMATH DE number 431768 (Why is no real title available?)
- scientific article; zbMATH DE number 7779295 (Why is no real title available?)
- Strong categorical datatypes II: A term logic for categorical programming
- Monadic vs adjoint decomposition
- Categories for computation in context and unified logic
- μ-Bicomplete Categories and Parity Games
- Tail recursion through universal invariants
- Let's see how things unfold: reconciling the infinite with the intensional (extended abstract)
- Structural induction and coinduction in a fibrational setting
- Restriction categories II: Partial map classification
- Deforestation, program transformation, and cut-elimination
- Extending set functors to generalised metric spaces
- Covariant types
- Inductive data types for predicate transformers
- Safe recursion revisited. I: Categorical semantics for lower complexity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137150)
