Proceedings of a tutorial and workshop on Category theory and computer programming
An introduction to the theory of lists
Proceedings of the NATO Advanced Study Institute on Logic of programming and calculi of discrete design
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Data structures and program transformation
Science of Computer Programming
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Basic category theory for computer scientists
Basic category theory for computer scientists
Algebra of programming
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Purely functional data structures
Purely functional data structures
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire
Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
Codifying Guarded Definitions with Recursive Schemes
TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
Proceedings of the IFIP TC2/WG2.1 Working Conference on Generic Programming
Polymorphic Type Schemes and Recursive Definitions
Proceedings of the 6th Colloquium on International Symposium on Programming
A Categorial Approch to the Theory of Lists
Proceedings of the International Conference on Mathematics of Program Construction, 375th Anniversary of the Groningen University
MPC '98 Proceedings of the Mathematics of Program Construction
A Typed Lambda Calculus with Categorical Type Constructors
Category Theory and Computer Science
Categorical Fixed Point Calculus
CTCS '95 Proceedings of the 6th International Conference on Category Theory and Computer Science
Recursion schemes from comonads
Nordic Journal of Computing
Simulating quantified class constraints
Haskell '03 Proceedings of the 2003 ACM SIGPLAN workshop on Haskell
Mathematical Structures in Computer Science
Two-level types and parameterized modules
Journal of Functional Programming
Scrap your boilerplate with class: extensible generic functions
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Applicative programming with effects
Journal of Functional Programming
Recursive coalgebras from comonads
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Proceedings of the 6th ACM SIGPLAN workshop on Generic programming
Category Theory
Kan extensions for program optimisation or: art and dan explain an old trick
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
| Hi-index | 0.00 |
Adjunctions are among the most important constructions in mathematics. These lecture notes show they are also highly relevant to datatype-generic programming. First, every fundamental datatype--sums, products, function types, recursive types--arises out of an adjunction. The defining properties of an adjunction give rise to well-known laws of the algebra of programming. Second, adjunctions are instrumental in unifying and generalising recursion schemes. We discuss a multitude of basic adjunctions and show that they are directly relevant to programming and to reasoning about programs.