Program optimisations via hylomorphisms for extraction of executable code

DOI10.4230/LIPICS.ITP.2025.32MaRDI QIDQ7323691zbMATH OpenFDO

Authors David Castro Perez, Marco Paviotti, Michael Vollmer

Publication date 1 September 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ITP.2025.32

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites work

• A new look at generalized rewriting in type theory
• Algebra of programming in Agda: Dependent types for relational program derivation
• Conjugate hylomorphisms -- or: the mother of all structured recursion schemes
• Containers: Constructing strictly positive types
• Deforestation: Transforming programs to eliminate trees
• Factorising folds for faster functions
• Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms
• Fast and loose reasoning is morally correct
• Functional Pearls
• scientific article; zbMATH DE number 910715 (Why is no real title available?)
• On well-founded and recursive coalgebras
• Parametricity in an impredicative sort
• Partiality and recursion in interactive theorem provers -- an overview
• Program calculation in Coq
• Program-ing finger trees in Coq
• Recursion schemes in Coq
• Recursive coalgebras from comonads
• Synthesis of distributed mobile programs using monadic types in Coq
• The Braga Method: Extracting Certified Algorithms from Complex Recursive Schemes in Coq
• The third homomorphism theorem on trees: downward \& upward lead to divide-and-conquer
• The worker/wrapper transformation
• Work it, wrap it, fix it, fold it

This page was built for publication: Program optimisations via hylomorphisms for extraction of executable code

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