Container types categorically

DOI10.1017/S0956796899003640MaRDI QIDQ4500365zbMATH OpenFDO

Authors Paul F. Hoogendijk, Oege de Moor

Publication date 26 April 2001

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0956796899003640

zbMATH Keywords

polytypic program derivations

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• scientific article; zbMATH DE number 1956503
• Higher-order containers
• Containers: Constructing strictly positive types
• Complexity bounds for container functors and comonads
• scientific article; zbMATH DE number 2061699

Cited in

(7)

• Datatype-generic termination proofs
• Formal derivation of greedy algorithms from relational specifications: a tutorial
• Towards patterns for heaps and imperative lambdas
• Containers: Constructing strictly positive types
• Formal polytypic programs and proofs
• scientific article; zbMATH DE number 1956503 (Why is no real title available?)
• Transport of finiteness structures and applications

This page was built for publication: Container types categorically

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