A generalization of short-cut fusion and its correctness proof

DOI10.1023/A:1022982420888zbMath1020.68022OpenAlexW1486010533MaRDI QIDQ1870296

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

zbMATH Keywords

operational semanticspolymorphismprogram transformationfunctional programmingparametricitycorrectness proofstheorems for freeshort-cut fusion

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items

A principled approach to programming with nested types in Haskell ⋮ Monadic augment and generalised short cut fusion ⋮ Asymptotic Improvement of Computations over Free Monads ⋮ Unnamed Item ⋮ Algebraic fusion of functions with an accumulating parameter and its improvement ⋮ Parametricity for primitive nested types ⋮ Selective strictness and parametricity in structural operational semantics, inequationally ⋮ Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism ⋮ Semantics and Pragmatics of New Shortcut Fusion Rules

This page was built for publication: A generalization of short-cut fusion and its correctness proof