Power series, power serious

Channel:
Microsoft Research
Subscribers:
349,000
Published on ● Video Link: https://www.youtube.com/watch?v=q8hDDTA7HmY


Duration: 43:26
259 views
5

I will sing praises for the power of lazy languages, notably Haskell, to express operations on infinite data structures, and will use power-series algorithms as a prime example. In this style of programming, subscripts magically evaporate; generating functions actively generate; and the math often looks prettier than it does in calculus books. One doesn't have to be a conoisseur of Haskell to appreciate the fine taste this new bottle imparts to familiar old wine.



Other Videos By Microsoft Research


2016-09-06No Ifs, Ands, or Buts: Uncovering the Simplicity of Conditionals
2016-09-06Refinement of Thread-Modular Verification
2016-09-06Dependable Software via Automated Verification
2016-09-06GENI - Global Environment for Network Innovations
2016-09-06Welcome - Overview of the day
2016-09-06Mantis and JouleSort: Power Models and Metrics in Enterprise Computing
2016-09-06Explicit-Symbolic Modeling for Formal Verification
2016-09-06Wired Shut: Copyright and the Shape of Digital Culture
2016-09-06Accelerating Architectural-Level Full-System Multiprocessor Simulations using FPGAs
2016-09-06Recurrence of weak graph limits
2016-09-06Power series, power serious
2016-09-06Acoustic Analysis and Modeling of Pathological Voices
2016-09-06Data Clustering and Stability of Finite Samples
2016-09-06Bulldozers, Termites, and Chainsaws: Finding a Gradual Path to Parallelism
2016-09-06Gibbs Measures on Trees and Random Graphs
2016-09-06Discovering Heap Anomalies in the Wild
2016-09-06Giving Campaign lunch: Woodland Park Zoo
2016-09-06oPtions: The Secret Life of Steve Jobs [1/92]
2016-09-06(Computational) Linguistics and the Web: Hot research questions
2016-09-06Education for a Brighter Future
2016-09-06Compiler and Microarchitectural Techniques for Leakage Power Reduction


Tags:
microsoft research