Structure and interpretation of computer programs
Structure and interpretation of computer programs
Software—Practice & Experience
A practical theory of programming
A practical theory of programming
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Generating power of lazy semantics
Theoretical Computer Science - Special volume on computer algebra
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Theoretical Computer Science
A coinductive calculus of streams
Mathematical Structures in Computer Science
Functional pearl: streams and unique fixed points
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Species and functors and types, oh my!
Proceedings of the third ACM Haskell symposium on Haskell
CEFP'09 Proceedings of the Third summer school conference on Central European functional programming school
Concrete stream calculus: An extended study
Journal of Functional Programming
Scans and convolutions: a calculational proof of Moessner's theorem
IFL'08 Proceedings of the 20th international conference on Implementation and application of functional languages
Dependable and Historic Computing
Fun with semirings: a functional pearl on the abuse of linear algebra
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |
Power series and stream processing were made for each other. Stream algorithms for power series are short, sweet, and compositional. Their neatness shines through in Haskell, thanks to pattern-matching, lazy lists, and operator overloading. In a short compass one can build working code from ground zero (scalar operations) up to exact calculation of generating functions and solutions of differential equations.