Datatypes as algebras

Add to your list(s) Download to your calendar using vCal

• Philip Saville (University of Cambridge)
• Friday 25 November 2016, 10:45-11:45
• Rainbow Room (FS07), Computer Laboratory.

If you have a question about this talk, please contact Ian Orton.

Datatypes like Nat, List, Tree,... are constructed in a similar way: inductively according to some constructors. How can we understand these constructions in a uniform way? One solution is the simple category-theoretic idea of an algebra. This idea can be used to capture not just lists and trees, but also much more general notions like the abstract syntax of a type system. I will introduce algebras and show why they are good models of structure, and show how properties like induction principles arise naturally out of this perspective. (The only category theory assumed will be the idea of a category and a functor).

This talk is part of the Logic & Semantics for Dummies series.

This talk is included in these lists:

• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Interested Talks
• Logic & Semantics for Dummies
• Rainbow Room (FS07), Computer Laboratory
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• rp587
• tcw57’s list
• yk373's list

Note that ex-directory lists are not shown.