ACM SIGPLAN Notices
Parallel program design: a foundation
Parallel program design: a foundation
The definition of Standard ML
Vector models for data-parallel computing
Vector models for data-parallel computing
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Powerlist: a structure for parallel recursion
A classical mind
Connection Machine Lisp: fine-grained parallel symbolic processing
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Journal of the ACM (JACM)
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Communications of the ACM
NESL: A Nested Data-Parallel Language (Version 2.6)
NESL: A Nested Data-Parallel Language (Version 2.6)
Verifying Adder Circuits Using Powerlists
Verifying Adder Circuits Using Powerlists
LISP 1.5 Programmer's Manual
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
A programming language
Programming with Divide-and-Conquer Skeletons: A Case Study of FFT
The Journal of Supercomputing
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
The Correctness of the Fast Fourier Transform: A Structured Proof in ACL2
Formal Methods in System Design
Computational Optimization and Applications
Derivation of a parallel string matching algorithm
Information Processing Letters
Certifying the Fast Fourier Transform with Coq
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Induction-Oriented Formal Verification in Symmetric Interconnection Networks
CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Declarative definition of group indexed data structures and approximation of their domains
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
SAT: a programming methodology with skeletons and collective operations
Patterns and skeletons for parallel and distributed computing
Parallelization of divide-and-conquer by translation to nested loops
Journal of Functional Programming
Processor Array Architectures for Deep Packet Classification
IEEE Transactions on Parallel and Distributed Systems
A calculus for parallel computations over multidimensional dense arrays
Computer Languages, Systems and Structures
Improved BDD Algorithms for the Simulation of Quantum Circuits
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Optimizing the parallel computation of linear recurrences using compact matrix representations
Journal of Parallel and Distributed Computing
A Formalization of Powerlist Algebra in ACL2
Journal of Automated Reasoning
An embedded declarative data transformation language
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Tree automata with memory, visibility and structural constraints
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Data-distributions in powerlist theory
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
A transformational approach which combines size inference and program optimization
SAIG'01 Proceedings of the 2nd international conference on Semantics, applications, and implementation of program generation
Recursion-driven parallel code generation for multi-core platforms
Proceedings of the Conference on Design, Automation and Test in Europe
On arithmetic computations with hereditarily finite sets, functions and types
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
A sufficient completeness reasoning tool for partial specifications
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Coverset induction with partiality and subsorts: a powerlist case study
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
A declarative specification of tree-based symbolic arithmetic computations
PADL'12 Proceedings of the 14th international conference on Practical Aspects of Declarative Languages
Formal engineering of the bitonic sort using PVS
IW-FM'98 Proceedings of the 2nd Irish conference on Formal Methods
A short cut to parallelization theorems
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Binary trees as a computational framework
Computer Languages, Systems and Structures
| Hi-index | 0.00 |
Many data-parallel algorithms—Fast Fourier Transform, Batcher's sorting schemes, and the prefix-sum—exhibit recursive structure. We propose a data structure called powerlist that permits succinct descriptions of such algorithms, highlighting the roles of both parallelism and recursion. Simple algebraic properties of this data structure can be explotied to derive properties of these algorithms and to establish equivalence of different algorithms that solve the same problem.