Amortized analysis via coalgebra

DOI10.46298/ENTICS.14797MaRDI QIDQ6831448zbMATH OpenFDO

Authors Harrison Grodin, Robert Harper

Publication date 2 April 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/ENTICS.14797

zbMATH Keywords

abstract data typesamortized analysisbicategoriescall-by-push-valuecoalgebracolax morphismscost analysisdata structuresindexed categoriesLax morphismsmonoidal adjunctionsprofunctorssimulationwriter monad

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Cites work

• Amortized analysis via coinduction (early ideas)
• Amortized complexity verified
• Amortized Computational Complexity
• Coalgebras for binary methods: Properties of bisimulations and invariants
• Enhanced 2-categories and limits for lax morphisms
• Enriching an Effect Calculus with Linear Types
• scientific article; zbMATH DE number 1195981 (Why is no real title available?)
• scientific article; zbMATH DE number 2079022 (Why is no real title available?)
• scientific article; zbMATH DE number 2120508 (Why is no real title available?)
• Introduction to coalgebra. Towards mathematics of states and observation
• Limits for lax morphisms
• Purely Functional Data Structures
• Relating coalgebraic notions of bisimulation
• Self-adjusting binary search trees
• Static prediction of heap space usage for first-order functional programs
• Tensors of comodels and models for operational semantics
• The enriched effect calculus: syntax and semantics
• Two decades of automatic amortized resource analysis
• Two-dimensional monad theory

This page was built for publication: Amortized analysis via coalgebra

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