Concrete stream calculus: An extended study

DOI10.1017/S0956796810000213zbMath1221.68072WikidataQ60692303 ScholiaQ60692303MaRDI QIDQ3021409

Ralf Hinze

Publication date: 25 July 2011

Published in: Journal of Functional Programming (Search for Journal in Brave)

zbMATH Keywords

binary carry sequence; Moessner's Theorem; recursion elimination; Sprague-Grundy numbers; stream equations

Mathematics Subject Classification ID

68N15: Theory of programming languages

68N18: Functional programming and lambda calculus

68P05: Data structures

Related Items

A Final Coalgebra for k-regular Sequences, Into the Infinite - Theory Exploration for Coinduction, A proof of Moessner's theorem by coinduction, Enhancing expressivity of checked corecursive streams, A characterization of Moessner's sieve, Unnamed Item

Uses Software

• Haskell
• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• A coinductive calculus of binary trees
• Generating power of lazy semantics
• The associativity of equivalence and the Towers of Hanoi problem
• The music of streams
• Behavioural differential equations: a coinductive calculus of streams, automata, and power series
• The worker/wrapper transformation
• The Bird Tree
• Generalised coinduction
• Perfect trees and bit-reversal permutations
• A coinductive calculus of streams
• Power series, power serious
• Functional pearl
• Applicative programming with effects