A monadic calculus for parallel costing of a functional language of arrays

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1300 LNCS, Issue , 1997, Pages 650-661

  Jay, C B ^a   Cole, M I ^b   Sekanina, M ^a   Steckler, P ^a  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; LINEAR ALGEBRA; PARALLEL PROGRAMMING;

FUNCTIONAL LANGUAGES; HASKELL; HIGHER-ORDER; NESTED ARRAYS; PARALLEL COMPUTATION; PRAM MODELS;

CALCULATIONS;

EID: 84882584876     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0002796     Document Type: Conference Paper

References (21)

1. G. E. Blelloch, S. Chatterjee, J. C. Hardwick, J. Sipelstein, and M. Zagha. Implementation of a portable nested data-parallel language. Journal of Parallel and Distributed Computing, 21(1), 1994.
2. G.E. Blelloch and J. Greiner. A provable time and space efficient implementation of NESL. In ACM SIGPLAN '96 International Conference on Functional Programming, pages 213-225, 1996.
3. G. E. Blelloch. Programming parallel algorithms. Communications of the ACM, 39(3): 85-97, 1996.
4. R. Bird and P. Wadler. Introduction to Functional Programming. International Series in Computer Science. Prentice Hall, 1988.
5. D.E. Culler and all. LogP: Towards a realistic model of parallel computation. In Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 1993.
6. P. Fradet and D. Le Métayer. Shape types. In Conference Record of the 24th ACM Symposium on Principles of Programming Languages, pages 27-39. ACM, New York, 1997.
7. P. Flajolet, B. Salvy, and P. Zimmermann. Average case analysis of algorithms. Theoretical Computer Science, 1991.
8. S. Fortune and J. Wyllie. Parallelism in random access machines. In Proceedings 10th STOC. ACM Press, 1978.
9. D.J. Gurr. Semantic frameworks for complexity. PhD thesis, University of Edinburgh, 1991. Available as ECS-LFCS-91-130.
10. T. Hickey and J. Cohen. Automating program analysis. Journal of the Association for Computing Machinery, 35(1): 185-220, 1988.
11. C.B. Jay and M. Sekanina. Shape checking of array programs. In Computing: the Australasian Theory Seminar, Proceedings, 1997, volume 19 of Australian Computer Science Communications, pages 113-121, 1997.
12. C.W. Kessler and H. Seidl. Fork95 Language and Compiler for the SB-PRAM. In 5th Intl. Workshop on Compilers for Parallel Computers, 1995.
13. D. Le Métayer. ACE: An automatic complexity evaluator. ACM Transactions on Programming Languages and Systems, 10(2): 248-266, 1988.
14. E. Moggi. Computational lambda-calculus and monads. In 4th LICS Conf., pages 14-23. IEEE, 1989.
15. F. Nielson and H.R. Nielson. Two-level functional languages. CUP, 1992.
16. D.B. Skillicorn. Foundations of Parallel Programming. Number 6 in Cambridge Series in Parallel Computation. Cambridge University Press, 1994.
17. H.W. To. Optimizing the Parallel Behaviour of Combinations of Program Components. PhD thesis, Dept. of Computing, Imperial College, 1995.
18. L. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8): 103-111, 1990.
19. P. Wadler. Comprehending monads. MSCS, 2: 461-493, 1992.
20. B. Wegbreit. Mechanical program analysis. Communications of the ACM, 18(9): 528-539, 1975.
21. W. Zimmermann and W. Löwe. An approach to machine-independent parallel programming. In Parallel Processing: CONPAR 94 - VAPP VI, volume 854 of Lecture Notes in Computer Science, pages 277-288. Springer, 1994.