Two applications of analytic functors
Theoretical Computer Science - Special issue on theories of types and proofs
On the Interpretation of Type Theory in Locally Cartesian Closed Categories
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Journal of Functional Programming
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
The differential Lambda-calculus
Theoretical Computer Science
Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
Interfaces as functors, programs as coalgebras: a final coalgebra theorem in intensional type theory
Theoretical Computer Science
Containers: constructing strictly positive types
Theoretical Computer Science - Applied semantics: Selected topics
∂ for Data: Differentiating Data Structures
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
A static simulation of dynamic delimited control
Higher-Order and Symbolic Computation
Fast and sound random generation for automated testing and benchmarking in objective Caml
Proceedings of the 2009 ACM SIGPLAN workshop on ML
Generic programming with dependent types
SSDGP'06 Proceedings of the 2006 international conference on Datatype-generic programming
Traces, executions and schedulers, coalgebraically
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Scrap your zippers: a generic zipper for heterogeneous types
Proceedings of the 6th ACM SIGPLAN workshop on Generic programming
Species and functors and types, oh my!
Proceedings of the third ACM Haskell symposium on Haskell
Interfaces as games, programs as strategies
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
Discrete generalised polynomial functors
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
∂ for Data: Differentiating Data Structures
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Data Types with Symmetries and Polynomial Functors over Groupoids
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
We are investigating McBride's idea that the type of one-hole contexts are the formal derivative of a functor from a categorical perspective. Exploiting our recent work on containers we are able to characterise derivatives by a universal property and show that the laws of calculus including a rule for initial algebras as presented by McBride hold -- hence the differentiable containers include those generated by polynomials and least fixpoints. Finally, we discuss abstract containers (i.e. quotients of containers) -- this includes a container which plays the role of ex in calculus by being its own derivative.