On building cyclic and shared structures in Haskell

DOI10.1007/S00165-012-0243-6zbMATH Open1259.68026DBLPjournals/fac/Bird12OpenAlexW2002373993WikidataQ60691911 ScholiaQ60691911MaRDI QIDQ1941875FDOQ1941875

Authors: 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

Recommendations

• Cyclic monads and their application
• scientific article; zbMATH DE number 3959427
• A principled approach to programming with nested types in Haskell
• Regular, shape-polymorphic, parallel arrays in Haskell
• Implementation of Functional Languages
• Implementing hash-consed structures in Coq
• Initial Algebra Semantics for Cyclic Sharing Structures
• Constructed product result analysis for Haskell

zbMATH Keywords

pointer algorithmsprogram calculationrecursive structuresformal program designlazy functional programming

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites Work

• Title not available (Why is that?)
• Fast Pattern Matching in Strings
• Title not available (Why is that?)
• The derivation of systolic computations
• Title not available (Why is that?)
• Calculational derivation of pointer algorithms from tree operations

Cited In (3)

• Correct Looping Arrows from Cyclic Terms
• Functional programming with structured graphs
• Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition

Uses Software

• Haskell
• OEIS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1941875)