Asymptotic Improvement of Computations over Free Monads

DOI10.1007/978-3-540-70594-9_20zbMATH Open1156.68363OpenAlexW1590681881MaRDI QIDQ3521997FDOQ3521997

Authors: 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

Recommendations

• Monads for incremental computing
• Monadic augment and generalised short cut fusion
• Free applicative functors
• Improvements for free
• Monadic augment and generalised short cut fusion

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

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

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

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