Higher-order containers

DOI10.1007/978-3-642-13962-8_2zbMATH Open1286.68327DBLPconf/cie/AltenkirchLS10OpenAlexW1530894146WikidataQ61583791 ScholiaQ61583791MaRDI QIDQ3576186FDOQ3576186

Authors: Thorsten Altenkirch, Paul Blain Levy, Sam Staton 

Publication date: 29 July 2010

Published in: Programs, Proofs, Processes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13962-8_2

Recommendations

• scientific article; zbMATH DE number 1956503
• Containers: Constructing strictly positive types
• Complexity bounds for container functors and comonads
• Container combinatorics: monads and lax monoidal functors
• When is a container a comonad?

zbMATH Keywords

functional programmingcategory theorydatatypes

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Abstract data types; algebraic specification (68Q65)

Cited In (15)

• Stabilized profunctors and stable species of structures
• CHAD for expressive total languages
• Title not available (Why is that?)
• Container model
• Complexity bounds for container functors and comonads
• Container combinatorics: monads and lax monoidal functors
• Directed containers as categories
• Title not available (Why is that?)
• Indexed containers
• Higher order architecture of collections of objects
• When is a container a comonad?
• Containers: Constructing strictly positive types
• When is a container a comonad?
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Higher-order containers

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