Shortcut fusion rules for the derivation of circular and higher-order programs
From MaRDI portal
Publication:1929359
DOI10.1007/s10990-011-9076-xzbMath1256.68034OpenAlexW1974208570MaRDI QIDQ1929359
João Saraiva, Alberto Pardo, João Paulo Fernandes
Publication date: 8 January 2013
Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)
Full work available at URL: http://repositorio.inesctec.pt/handle/123456789/3435
Cites Work
- Using circular programs to eliminate multiple traversals of data
- Deforestation: Transforming programs to eliminate trees
- Using circular programs to deforest in accumulating parameters
- Lightweight fusion by fixed point promotion
- Foundations for structured programming with GADTs
- Free theorems in the presence of seq
- Monadic parsing in Haskell
- Semantics of value recursion for Monadic Input/Output
- Generic Programming
- Linear, bounded, functional pretty-printing
- Fast and loose reasoning is morally correct
- Advanced Functional Programming
- Semantics and Pragmatics of New Shortcut Fusion Rules
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item