The implementation and efficiency of arrays in clean 1.1

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

Volumn 1268, Issue , 1997, Pages 105-124

  van Groningen, John H G ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES;

FAST FOURIER TRANSFORMATIONS; LAZY FUNCTIONAL PROGRAMMING; NEW APPROACHES; SORTING ALGORITHM;

FUNCTIONAL PROGRAMMING;

EID: 84957703920     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63237-9_21     Document Type: Conference Paper

References (14)

1. [AnHu90] Andersen, S. and P. Hudak. 1990. Compilation of Haskell Array Comprehensions for Scientific Computing. In Proc. of the ACM SIGPLAN'90 Conf. on Programming Language Design and Implementation, New York, pp. 137-149.
2. [BaSm93] Barendsen E., and J.E.W. Smetsers. 1993. Conventional and Uniqueness Typing in Graph Rewrite Systems. In proceedings 13th conference Foundations of Software Technology and Theoretical Computer Science, Bombay, India, December 1993, pp. 41-51, LNCS 761.
3. [Feo92] Feo, J. A Comparative Study of Parallel Programming Languages: The Salishan Problems. 1992. North Holland, ISBN 0-444-88135-2.
4. [Fi0195] Fitzgerald, S.M. and R.R. Oldehoeft. 1995. Update-in-place Analysis for True Multidimensional Arrays. High Performance Functional Computing, pp. 105-118.
5. [Jone95] Jones, M.P. 1995. A system of constructor classes: overloading and implicit higher-order polymorphism. In Journal of Functional Programming 5(1) January 1995, Cambridge University Press, pp. 1-35.
6. [NoSm93] Necker, E.G.J.M.H., and J.E.W. Smetsers. 1993. Partially strict non-recursive data types. In Journal of Functional Programming 3(2), pp. 191-215.
7. [Lero92] Leroy X. 1992. Unboxed objects and polymorphic typing. Proc. 19th Symp. Principles of Programming Languages, pp. 177-188.
8. [MuK1Sc96] Mullin, L.R., W.E. Kluge and S. Scholz. 1996. On Programming Scientific Applications in SAC - a Functional Language Extended by a Subsystem for High-Level Array Operations. Proc. of the 8th International Workshop on Implementation of Functional Languages.
9. [PeLa91] Peyton Jones, S.L. and J. Launchbury. 1991. Unboxed values as first class citizens in a non-strict functional language. In Proc. of Conference on Functional Programming Languages and Computer Architecture (FPCA '91), Sept. 1991, Cambridge, LNCS 523.
10. [PeWa92] Peyton Jones, S.L. and P. Wadler. 1992. Imperative functional programming. ACM Symposium on Principles of Programming Languages (POPL), pp.71-84.
11. [PlaEe95] Plasmeijer, M.J., and M.C.J.D. van Eekelen. 1995. Clean 1.1 Reference Manual. Technical Report. University of Nijmegen, The Netherlands.
12. [Serr96] Serrarens, P.R. A Clean Conjugate Gradient Algorithm. 1996. Proc. of the 8th International Workshop on Implementation of Functional Languages.
13. [SNGP91] Smetsers, J.E.W., E.G.J.M.H. Necker, J.H.G. van Groningen and M.J. Plasmeijer. 1991. Generating Efficient Code for Lazy Functional Languages, In Proc. of Conference on Functional Programming Languages and Computer Architecture (FPCA '91), Cambridge, MA, USA, Springer-Verlag, LNCS 523, pp. 592-617.
14. [Wad186] Wadler. P. 1986. A new array operation for functional languages. In Proc. Graph Reduction Workshop, Santa Fe, Springer Verlag, LNCS 295.