On building cyclic and shared structures in Haskell

DOI10.1007/S00165-012-0243-6zbMath1259.68026DBLPjournals/fac/Bird12OpenAlexW2002373993WikidataQ60691911 ScholiaQ60691911MaRDI QIDQ1941875

Richard S. Bird

Publication date: 22 March 2013

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-012-0243-6

zbMATH Keywords

pointer algorithmsprogram calculationrecursive structuresformal program designlazy functional programming

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (1)

Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition

Uses Software

• Haskell
• OEIS

Cites Work

• The derivation of systolic computations
• Calculational derivation of pointer algorithms from tree operations
• Fast Pattern Matching in Strings
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On building cyclic and shared structures in Haskell