Kan Extensions for Program Optimisation Or: Art and Dan Explain an Old Trick

DOI10.1007/978-3-642-31113-0_16zbMath1358.68057OpenAlexW1764096108MaRDI QIDQ2908573

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

zbMATH Keywords

powerHaskellbacktrackingadjunctionstring diagramKan extensionCPScodensity monadChurch representationend formulas

Mathematics Subject Classification ID

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

Related Items

Complexity bounds for container functors and comonads ⋮ Unnamed Item ⋮ Backtracking with cut via a distributive law and left-zero monoids