Kan extensions for program optimisation Or: Art and Dan explain an old trick

DOI10.1007/978-3-642-31113-0_16zbMATH Open1358.68057OpenAlexW1764096108MaRDI QIDQ2908573FDOQ2908573

Ralf Hinze

Publication date: 5 September 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-31113-0_16

Recommendations

• Abstract Interpretation, Logical Relations, and Kan Extensions
• A reflection on call-by-value
• scientific article; zbMATH DE number 512948
• Monadic augment and generalised short cut fusion
• Notions of computation and monads

zbMATH Keywords

poweradjunctionbacktrackingstring diagramKan extensionCPSHaskellcodensity monadChurch representationend formulas

Mathematics Subject Classification ID

Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Functional programming and lambda calculus (68N18)

Cited In (4)

• Backtracking with cut via a distributive law and left-zero monoids
• Fast left Kan extensions using the chase
• Title not available (Why is that?)
• Complexity bounds for container functors and comonads

This page was built for publication: Kan extensions for program optimisation Or: Art and Dan explain an old trick

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