The adjoints to the derivative functor on species
Journal of Combinatorial Theory Series A
Two applications of analytic functors
Theoretical Computer Science - Special issue on theories of types and proofs
Shapely Types and Shape Polymorphism
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
On Relating Type Theories and Set Theories
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
On the Interpretation of Type Theory in Locally Cartesian Closed Categories
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
The differential Lambda-calculus
Theoretical Computer Science
Journal of Functional Programming
Journal of Functional Programming
Containers: constructing strictly positive types
Theoretical Computer Science - Applied semantics: Selected topics
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Epigram: practical programming with dependent types
AFP'04 Proceedings of the 5th international conference on Advanced Functional Programming
Constructing strictly positive families
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Clowns to the left of me, jokers to the right (pearl): dissecting data structures
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Continuous Functions on Final Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Constructing language processors with algebra combinators
Science of Computer Programming
Scrap your zippers: a generic zipper for heterogeneous types
Proceedings of the 6th ACM SIGPLAN workshop on Generic programming
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Calculating tree navigation with symmetric relational zipper
Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation
A foundation for GADTs and inductive families: dependent polynomial functor approach
Proceedings of the seventh ACM SIGPLAN workshop on Generic programming
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Exploring the regular tree types
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
When is a container a comonad?
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Discrete generalised polynomial functors
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Functional programming with structured graphs
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Hi-index | 0.00 |
This paper and our conference paper (Abbott, Altenkirch, Ghani, and McBride, 2003b) explain and analyse the notion of the derivative of a data structure as the type of its one-hole contexts based on the central observation made by McBride (2001). To make the idea precise we need a generic notion of a data type, which leads to the notion of a container, introduced in (Abbott, Altenkirch, and Ghani, 2003a) and investigated extensively in (Abbott, 2003). Using containers we can provide a notion of linear map which is the concept missing from McBride's first analysis. We verify the usual laws of differential calculus including the chain rule and establish laws for initial algebras and terminal coalgebras.