Generic programming with adjunctions

DOI10.1007/978-3-642-32202-0_2MaRDI QIDQ4649379zbMATH OpenOpenAlexFDO

Authors Ralf Hinze

Publication date 21 November 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-32202-0_2

Mathematics Subject Classification ID

Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Generic properties of datatypes.
• Unifying structured recursion schemes
• Adjoint folds and unfolds. Or: Scything through the thicket of morphisms
• scientific article; zbMATH DE number 4010736
• Unifying structured recursion schemes. An extended study

Cited in

(15)

• Amalgamating sessions and methods in object-oriented languages with generics
• A functional approach to generic programming using adaptive traversals
• Practical Optional Types for Clojure
• Adjoint folds and unfolds. Or: Scything through the thicket of morphisms
• scientific article; zbMATH DE number 4010736 (Why is no real title available?)
• scientific article; zbMATH DE number 2100542 (Why is no real title available?)
• Generic functional programming with types and relations
• Generic properties of datatypes.
• Unifying structured recursion schemes
• scientific article; zbMATH DE number 5165714 (Why is no real title available?)
• An extended comparative study of language support for generic programming
• Adjunctions and data collections
• Unifying structured recursion schemes. An extended study
• A duality of sorts
• Fantastic morphisms and where to find them. A guide to recursion schemes

This page was built for publication: Generic programming with adjunctions

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