Parametrized data types do not need highly constrained parameters

DOI10.1016/S0019-9958(82)80026-0zbMATH Open0505.68013OpenAlexW1984190288MaRDI QIDQ4742295FDOQ4742295

Authors: Michael A. Arbib, Ernest G. Manes 

Publication date: 1982

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(82)80026-0

zbMATH Keywords

data typesfunctorial fixed points

Mathematics Subject Classification ID

Data structures (68P05) General theory of categories and functors (18A99)

Cited In (8)

• Structural induction and coinduction in a fibrational setting
• Universal coalgebra: A theory of systems
• From grammars and automata to algebras and coalgebras
• Swinging types=functions+relations+transition systems
• Algebraic-coalgebraic specification in CoCASL
• A logic of implications in algebra and coalgebra
• Induction, coinduction, and adjoints
• Title not available (Why is that?)

This page was built for publication: Parametrized data types do not need highly constrained parameters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4742295)