Species and functors and types, oh my!

2Citations
Citations of this article
37Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The theory of combinatorial species, although invented as a purely mathematical formalism to unify much of combinatorics, can also serve as a powerful and expressive language for talking about data types. With potential applications to automatic test generation, generic programming, and language design, the theory deserves to be much better known in the functional programming community. This paper aims to teach the basic theory of combinatorial species using motivation and examples from the world of functional programming. It also introduces the species library, available on Hackage, which is used to illustrate the concepts introduced and can serve as a platform for continued study and research. Copyright © 2010 ACM.

Cite

CITATION STYLE

APA

Yorgey, B. A. (2010). Species and functors and types, oh my! ACM SIGPLAN Notices, 45(11), 147–158. https://doi.org/10.1145/2088456.1863542

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free