A generalization of short-cut fusion and its correctness proof
From MaRDI portal
Publication:1870296
DOI10.1023/A:1022982420888zbMATH Open1020.68022OpenAlexW1486010533MaRDI QIDQ1870296FDOQ1870296
Authors: Patricia Johann 
Publication date: 11 May 2003
Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022982420888
Recommendations
functional programmingpolymorphismparametricitycorrectness proofsoperational semanticsprogram transformationtheorems for freeshort-cut fusion
Cited In (18)
- Title not available (Why is that?)
- Improvements for free
- Parametricity for primitive nested types
- Syntactic composition of top-down tree transducers is short cut fusion
- Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism
- Short cut fusion is correct
- On proving the correctness of program transformations based on free theorems for higher-order polymorphic calculi
- Selective strictness and parametricity in structural operational semantics, inequationally
- Shortcut fusion rules for the derivation of circular and higher-order programs
- Semantics and Pragmatics of New Shortcut Fusion Rules
- Algebraic fusion of functions with an accumulating parameter and its improvement
- Title not available (Why is that?)
- A principled approach to programming with nested types in Haskell
- Folding left and right matters: Direct style, accumulators, and continuations
- Asymptotic Improvement of Computations over Free Monads
- GADTs, functoriality, parametricity: pick two
- Monadic augment and generalised short cut fusion
- Concatenate, reverse and map vanish for free
This page was built for publication: A generalization of short-cut fusion and its correctness proof
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870296)
