Perfect trees and bit-reversal permutations
From MaRDI portal
Publication:4507961
DOI10.1017/S0956796800003701zbMath0957.68027MaRDI QIDQ4507961
Publication date: 10 October 2000
Published in: Journal of Functional Programming (Search for Journal in Brave)
Related Items
A principled approach to programming with nested types in Haskell ⋮ Generic programming in 3D ⋮ Parberry’s pairwise sorting network revealed ⋮ Concrete stream calculus: An extended study ⋮ Type Fusion
