Scans and convolutions: a calculational proof of Moessner's theorem

Authors:
Ralf Hinze
Affiliations:
Computing Laboratory, University of Oxford, Oxford, England
Venue:
IFL'08 Proceedings of the 20th international conference on Implementation and application of functional languages
Year:
2008

Citing 10
Cited 4

Theorems for free!

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Generating power of lazy semantics

Theoretical Computer Science - Special volume on computer algebra
The music of streams

Information Processing Letters - Special issue in honor of Edsger W. Dijkstra
A Final Coalgebra Theorem

Category Theory and Computer Science
Behavioural differential equations: a coinductive calculus of streams, automata, and power series

Theoretical Computer Science
Power series, power serious

Journal of Functional Programming
A coinductive calculus of streams

Mathematical Structures in Computer Science
Applicative programming with effects

Journal of Functional Programming
Functional pearl: streams and unique fixed points

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
The Capacity-C Torch Problem

MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction

The Peter Landin prize

Higher-Order and Symbolic Computation
Reasoning about codata

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
Stream processing coalgebraically

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper introduces two corecursion schemes for streamgenerating functions, scans and convolutions, and discusses their properties. As an application of the framework, a calculational proof of Paasche's generalisation of Moessner's intriguing theorem is presented.