Algorithmic skeletons: structured management of parallel computation
Algorithmic skeletons: structured management of parallel computation
Rippling: a heuristic for guiding inductive proofs
Artificial Intelligence
An abstract formalization of correct schemas for program synthesis
Journal of Symbolic Computation - Special Issue on Schemas
Proof planning for strategy development
Annals of Mathematics and Artificial Intelligence
The Use of Planning Critics in Mechanizing Inductive Proofs
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Logic Program Synthesis in a Higher-Order Setting
CL '00 Proceedings of the First International Conference on Computational Logic
The Use of Explicit Plans to Guide Inductive Proofs
Proceedings of the 9th International Conference on Automated Deduction
System Description: Proof Planning in Higher-Order Logic with Lambda-Clam
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Automatic synthesis of recursive programs: the proof-planning paradigm
ASE '97 Proceedings of the 12th international conference on Automated software engineering (formerly: KBSE)
Towards Automatic Imperative Program Synthesis through Proof Planning
ASE '99 Proceedings of the 14th IEEE international conference on Automated software engineering
Skeleton realisations from functional prototypes
Patterns and skeletons for parallel and distributed computing
A parallel SML compiler based on algorithmic skeletons
Journal of Functional Programming
Dynamic rippling, middle-out reasoning and lemma discovery
Verification, induction termination analysis
Dynamic rippling, middle-out reasoning and lemma discovery
Verification, induction termination analysis
| Hi-index | 0.00 |
The close association between higher order functionsand algorithmic skeletons is a promising source of automaticparallelisation of programs. An approach to automaticallysynthesizing higher order functions from functionalprograms through proof planning is presented. Our workhas been conducted within the context of a parallelisingcompiler for SML, with the objective of exploiting parallelismlatent in potential higher order function use in programs.