Datatypes as algebras
- đ¤ Speaker: Philip Saville (University of Cambridge)
- đ Date & Time: Friday 25 November 2016, 10:45 - 11:45
- đ Venue: Rainbow Room (FS07), Computer Laboratory
Abstract
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).
Series This talk is part of the Logic & Semantics for Dummies series.
Included in Lists
- bld31
- Cambridge Centre for Data-Driven Discovery (C2D3)
- Cambridge talks
- Chris Davis' list
- Interested Talks
- Logic & Semantics for Dummies
- ndk22's list
- ob366-ai4er
- Rainbow Room (FS07), Computer Laboratory
- rp587
- tcw57âs list
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)


Friday 25 November 2016, 10:45-11:45