Containers: Constructing strictly positive types

DOI10.1016/j.tcs.2005.06.002zbMath1077.68015WikidataQ61583925 ScholiaQ61583925MaRDI QIDQ2566024

Yanyan Li

Publication date: 22 September 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.06.002

zbMATH Keywords

Induction; Category theory; Initial algebras; Type theory; Coinduction; Container functors; Final coalgebras; W-Types

Mathematics Subject Classification ID

68N18: Functional programming and lambda calculus

Related Items

Non-well-founded trees in categories, A UNIVERSE OF STRICTLY POSITIVE FAMILIES

Uses Software

• Epigram

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-well-founded trees in categories
• Categorical logic and type theory
• Representing inductively defined sets by wellorderings in Martin-Löf's type theory
• Wellfounded trees in categories
• Generalised folds for nested datatypes
• Locally cartesian closed categories and type theory
• Fibered categories and the foundations of naive category theory
• Categories for Types
• Container types categorically
• Extensional Constructs in Intensional Type Theory
• The view from the left
• Mathematics of Program Construction
• Advanced Functional Programming
• Automata, Languages and Programming
• Types for Proofs and Programs
• Two applications of analytic functors