Group-based fields

  • Jean-Louis Giavitto
  • Olivier Michel
  • Jean-Paul Sansonnet
Irregular Data Structures and Applications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1068)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J.-L. Giavitto. A synchronous data-flow language for massively parallel computer. In D. J. Evans, G. R. Joubert, and H. Liddell, editors, Proc. of Int. Conf. on Parallel Computing (ParCo'91), pages 391–397, London, 3–6 September 1991. North-Holland.Google Scholar
  2. 2.
    O. Michel and J.-L. Giavitto. Design and implementation of a declarative data-parallel language. In post-ICLP'94 workshop W6 on Parallel and Data Parallel Execution of Logic Programs, S. Margherita Liguria, Italy, 17 June 1994. Uppsala University, Computing Science Department.Google Scholar
  3. 3.
    J. M. Sipelstein and G. E. Belloch. Collection-oriented languages. Proc. of the IEEE, 79(4), April 1991.Google Scholar
  4. 4.
    J. T. Schwartz, R. B. K. Dewar, E. Dubinsky, and E. Schonberg. Programming with sets: and introduction to SETL. Springer-Verlag, 1986.Google Scholar
  5. 5.
    J.-P. Bânatre, A. Coutant, and D. Le Metayer. A parallel machine for multiset transformation and its programming style. Future Generation Computer Systems, 4:133–144, 1988.Google Scholar
  6. 6.
    G. E. Blelloch. NESL: A nested data-parallel language (version 2.6). Technical Report CMU-CS-93-129, School of Computer Science, Carnegie Mellon University, April 1993.Google Scholar
  7. 7.
    G. Hains and L. M. R. Mullin. An algebra of multidimensional arrays. Technical Report 782, Université de Montréal, 1991.Google Scholar
  8. 8.
    E. Ashcroft, A. Faustini, R. Jagannatha, and W. Wadge. Multidimensional Programming. Oxford University Press, February 1995. ISBN 0-19-507597-8.Google Scholar
  9. 9.
    K. E. Iverson. A dictionnary of APL. APL quote Quad, 18(1), September 1987.Google Scholar
  10. 10.
    O. Michel. A guided tour to 81/2 and its dynamical extensions. Technical report, Laboratoire de Recherche en Informatique, December 1995.Google Scholar
  11. 11.
    H. Cohen. A course in computational algebraic number theory, volume 138 of Graduate Text in Mathematics. Springer-Verlag, 1993.Google Scholar
  12. 12.
    C. S. Iliopoulos. Worst-case complexity bounds on algorithms for computing the canonical structure of finite abelian groups and the hermite and smith normal forms of an integer matrix. SIAM Journal on Computing, 18(4):658–669, August 1989.Google Scholar
  13. 13.
    T. J. Scheffler. A portable MPI-based parallel vector template library. Technical Report 95.04, RIACS, 1995.Google Scholar
  14. 14.
    Message-Passing Interface Forum. MPI: a message-passing interface standard, May 1994.Google Scholar
  15. 15.
    S. R. Kohn and S. B. Baden. A robust parallel programming model for dynamic non-uniform scientific computation. Technical Report TR-CS-94-354, U. of California at San-Diego, March 1994.Google Scholar
  16. 16.
    L. Semenzato. An abstract machine for partial differential equations. PhD thesis, U. of California at Berkeley, 1994.Google Scholar
  17. 17.
    D. Balsara, M. Lemke, and D. Quinlan. Adaptative, Multilevel and hierachical Computational strategies, chapter AMR++, a C++ object-oriented class library for parallel adaptative mesh refinment in fluid dynamics application, pages 413–433. Amer. Soc. of Mech. Eng., November 1992.Google Scholar
  18. 18.
    R. S. Bird. An introduction to the theory of lists. In M. Broy, editor, Logic of Programming and Calculi of Discrete Design, NATO ASI Series, vol. F36, pages 217–245. Springer-Verlag, 1987.Google Scholar
  19. 19.
    J. Misra. Powerlist: a structure for parallel recursion. ACM Trans. on Prog. Languages and Systems, 16(6):1737–1767, November 1994.Google Scholar
  20. 20.
    E. Goubault and T. P. Jensen. Homology of higher-dimensional automata. In Proc. of CONCUR'92. Springer-Verlag, 1992.Google Scholar
  21. 21.
    C. C. Squiers and Y. Kobayashi. A finiteness condition for rewriting systems. Theoretical Computer Science, 131(2):271–294, 12 September 1994.Google Scholar

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • Jean-Louis Giavitto
    • 1
  • Olivier Michel
    • 1
  • Jean-Paul Sansonnet
    • 1
  1. 1.LRI u.r.a. 410 du CNRS, Bâtiment 490Université de Paris-SudOrsay CedexFrance

Personalised recommendations