Complexity bounds for container functors and comonads

DOI10.1016/j.ic.2018.05.008zbMath1394.68240OpenAlexW2803566715WikidataQ129812215 ScholiaQ129812215MaRDI QIDQ1640987

Dominic A. Orchard

Publication date: 14 June 2018

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

Full work available at URL: https://doi.org/10.1016/j.ic.2018.05.008

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• GHC

Cites Work

• Unnamed Item
• Unnamed Item
• Deforestation: Transforming programs to eliminate trees
• Normal functors, power series and \(\lambda\)-calculus
• Costing parallel programs as a function of shapes
• Container combinatorics: monads and lax monoidal functors
• A cost calculus for parallel functional programming
• A semantics for shape
• Containers: Constructing strictly positive types
• Comonadic Notions of Computation
• When is a container a comonad?
• When Is a Container a Comonad?
• Kan Extensions for Program Optimisation Or: Art and Dan Explain an Old Trick
• Towards a Definition of an Algorithm
• Timed Sets, Functional Complexity, and Computability
• Asymptotic Improvement of Computations over Free Monads
• Logical Approaches to Computational Barriers