Fusion of recursive programs with computational effects

DOI10.1016/S0304-3975(00)00127-4zbMath0973.68033OpenAlexW2010907903WikidataQ127846318 ScholiaQ127846318MaRDI QIDQ5941164

No author found.

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00127-4

zbMATH Keywords

effectsdeforestationmonadsprogram fusionrecursive operators

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Data structures (68P05)

Related Items (1)

Monadic augment and generalised short cut fusion

Uses Software

• Haskell

Cites Work

• Data structures and program transformation
• Notions of computation and monads
• Deforestation: Transforming programs to eliminate trees
• Algebraic specification of data types: A synthetic approach
• The theory of semi-functors
• Comprehending monads
• The under-appreciated unfold
• Fold and unfold for program semantics
• Lifting theorems for Kleisli categories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fusion of recursive programs with computational effects