Asymptotic Improvement of Computations over Free Monads

DOI10.1007/978-3-540-70594-9_20zbMath1156.68363OpenAlexW1590681881MaRDI QIDQ3521997

Janis Voigtländer

Publication date: 28 August 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70594-9_20

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

Complexity bounds for container functors and comonads ⋮ Interleaving data and effects ⋮ Notions of computation as monoids ⋮ Classical misuse attacks on NIST round 2 PQC. The power of rank-based schemes ⋮ Combining deep and shallow embedding of domain-specific languages ⋮ Factorising folds for faster functions

Cites Work

• Notions of computation and monads
• A generalization of short-cut fusion and its correctness proof
• Monadic augment and generalised short cut fusion
• Data types à la carte
• Monadic augment and generalised short cut fusion
• Two-level types and parameterized modules

This page was built for publication: Asymptotic Improvement of Computations over Free Monads