The following pages link to (Q3137150):
Displaying 18 items.
- Safe recursion revisited. I: Categorical semantics for lower complexity (Q386608) (← links)
- Strong categorical datatypes II: A term logic for categorical programming (Q673963) (← links)
- Categories for computation in context and unified logic (Q678833) (← links)
- Tail recursion through universal invariants (Q685396) (← links)
- Inductive data types for predicate transformers (Q1199549) (← links)
- Structural induction and coinduction in a fibrational setting (Q1275820) (← links)
- Covariant types (Q1390953) (← links)
- Restriction categories II: Partial map classification (Q1398462) (← links)
- Shortcut fusion rules for the derivation of circular and higher-order programs (Q1929359) (← links)
- Monadic vs adjoint decomposition (Q2134643) (← links)
- Let’s See How Things Unfold: Reconciling the Infinite with the Intensional (Extended Abstract) (Q2888481) (← links)
- Extending set functors to generalised metric spaces (Q4625693) (← links)
- <i>μ</i>-Bicomplete Categories and Parity Games (Q4787834) (← links)
- Deforestation, program transformation, and cut-elimination (Q4917034) (← links)
- Decomposing typed lambda calculus into a couple of categorical programming languages (Q5057475) (← links)
- The Recursion Scheme from the Cofree Recursive Comonad (Q5166625) (← links)
- Coalgebras as Types Determined by Their Elimination Rules (Q5253935) (← links)
- Protocol choice and iteration for the free cornering (Q6151626) (← links)
