Tag Archives: finite

Combinatorial Species and Finite Sets in HoTT

(Post by Brent Yorgey) My dissertation was on the topic of combinatorial species, and specifically on the idea of using species as a foundation for thinking about generalized notions of algebraic data types. (Species are sort of dual to containers; … Continue reading

Posted in Applications, Higher Inductive Types, Programming | Tagged , , | 6 Comments