scientific article

zbMath0792.18008MaRDI QIDQ3137150

Dwight Spencer, J. Robin B. Cockett

Publication date: 4 November 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

fibrationsstrengthstrong datatypes

Mathematics Subject Classification ID

Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Abstract data types; algebraic specification (68Q65) Fibered categories (18D30) Grammars and rewriting systems (68Q42) Data structures (68P05) Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Embedding theorems, universal categories (18B15) Eilenberg-Moore and Kleisli constructions for monads (18C20) Actions of a monoidal category, tensorial strength (18D25)

Related Items (19)

μ-Bicomplete Categories and Parity Games ⋮ Let’s See How Things Unfold: Reconciling the Infinite with the Intensional (Extended Abstract) ⋮ Monadic vs adjoint decomposition ⋮ Decomposing typed lambda calculus into a couple of categorical programming languages ⋮ Safe recursion revisited. I: Categorical semantics for lower complexity ⋮ Shortcut fusion rules for the derivation of circular and higher-order programs ⋮ Covariant types ⋮ Restriction categories II: Partial map classification ⋮ Protocol choice and iteration for the free cornering ⋮ Unnamed Item ⋮ Strong categorical datatypes II: A term logic for categorical programming ⋮ Categories for computation in context and unified logic ⋮ Tail recursion through universal invariants ⋮ Inductive data types for predicate transformers ⋮ Deforestation, program transformation, and cut-elimination ⋮ The Recursion Scheme from the Cofree Recursive Comonad ⋮ Extending set functors to generalised metric spaces ⋮ Structural induction and coinduction in a fibrational setting ⋮ Coalgebras as Types Determined by Their Elimination Rules

This page was built for publication: