Declarative definition of group indexed data structures and approximation of their domains

Proceedings of the 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn , Issue , 2001, Pages 150-161

  Giavitto, Jean Louis ^a   Michel, Olivier ^a  

^a UNIVERSITÉ D EVRY VAL D ESSONNE   (France)

Author keywords

Cayley graph; Data field; Extension analysis; Recursive definition of data structures

Indexed keywords

ALGEBRA; APPROXIMATION THEORY; GRAPH THEORY; HIGH LEVEL LANGUAGES;

CAYLEY GRAPHS;

DATA STRUCTURES;

EID: 0035790476     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/773184.773201     Document Type: Conference Paper

References (30)

1. E. A. Ashcroft, A. Faustini, R. Jagannathan, and W. Wadge. Multidimensional Programming. Oxford University Press, February 1995. ISBN 0-19-507597-8.
2. 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., Nov. 1992.
3. F. Bergeron, G. Labelle, and P. Leroux. Combinatorial species and tree-like structures, volume 67 of Encyclopedia of mathematics and its applications. Cambridge University Press, 1997. isbn 0-521-57323-8.
4. 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.
5. G. Blelloch. Scans as primitive parallel operations. IEEE Transactions on Computers, 38(11):1526-1538, Nov. 1989.
6. H. Cohen. A course in computational algebraic number theory, volume 138 of Graduate Text in Mathematics. Springer-Verlag, 1993.
7. D. De Vito. Conception et implémentation d'un modèle d'exécution pour un langage déclaratif data-parallèle. Thèse de doctorat, Université de Paris-Sud, centre d'Orsay, June 1998.
8. P. Feautrier. Dataflow analysis of scalar and array references. Int. Journal of Parallel Programming, 20(1):23-53, Feb. 1991.
9. rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 284-294, St. Petersburg Beach, Florida, 21-24 Jan. 1996.
10. P. Fradet and D. L. Métayer. Shape types. In Proc. of Principles of Programming Languages, Paris, France, Jan. 1997. ACM Press.
11. D. Gautier and C. Germain. A static approach for compiling communications in parallel scientific programs. Scientific Programming, 4:291-305, 1995.
12. J.-L. Giavitto. Scientific Repport for the HDR. PhD thesis, LRI, Université de Paris-Sud, centre d'Orsay, Sept. 1999. Research Report 1226.
13. J.-L. Giavitto. A framework for the recursive definition of data structures. In ACM-Sigplan 2nd International Conference on Principles and Practice of Declarative Programming (PPDP'00), pages 45-55, Montréal, Sept. 2000. ACM-press.
14. n. In EuroPar'98 Parallel Processing, volume 1470 of Lecture Notes in Computer Science, pages 742-??, Sept. 1998.
15. 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, Aug. 1989.
16. K. E. Iverson. A dictionnary of APL. APL quote Quad, 18(1), Sept. 1987.
17. C. B. Jay. A semantics of shape. Science of Computer Programming, 25(2-3):251-283, 1995.
18. W. Kelly, V. Maslov, W. Pugh, E. Rosser, T. Shpeisman, and D. Wonnacott. The Omega calculator and library, version 1.1.0. College Park, MD 20742, 18 november 1996.
19. W. Kelly, W. Pugh, E. Rosser, and T. Shpeisman. Transitive closure of infinite graphs and its application. Technical Report UMIACS-TR-95-48, CS-TR-3457, Univ. of Maryland, College Park, MD 20742, 14 Aprils 1994.
20. B. Lisper. On the relation between functional and data-parallel programming languages. In Proc. of the 6th. Int. Conf. on Functional Languages and Computer Architectures. ACM, ACM Press, June 1993.
21. B. Lisper and J.-F. Collard. Extent analysis of data fields. Technical Report TRITA-IT R 94:03, Royal Institute of Technology, Sweden, January 1994.
22. O. Michel. Représentations dynamiques de l'espace dans un langage déclaratif de simulation. PhD thesis, Université de Paris-Sud, centre d'Orsay, Dec. 1996. No°4596, (in french).
23. J. Misra. Powerlist: a structure for parallel recursion. ACM Trans. on Prog. Languages and Systems, 16(6):1737-1767, November 1994.
24. S. Nishimura and A. Ohori. A calculus for exploiting data parallelism on recursively defined data (Preliminary Report). In International Workshop TPPP '94 Proceedings (LNCS 907), pages 413-432. Springer-Verlag, Nov. 94.
25. Z. Róka. One-way cellular automata on Cayley graphs. Theoretical Computer Science, 132(1-2):259-290, 26 Sept. 1994.
26. M. Schnert. GAP 3.3. ftp samson.math.rwth-aachen.de:/pub/gap, 7 Nov. 1993.
27. L. Semenzato. An abstract machine for partial differential equations. PhD thesis, U. of California at Berkeley, 1994.
28. T. Torgersen. Parallel scheduling of recursively defined arrays: Revisited. Journal of Symbolic Computation, 16:189-226, 1993.
29. J. van Leeuwen, editor. Handbook in theoretical computer science. Elsevier Science Publishers, 1990.
30. A. White. Graphs, groups and surfaces. Mathematics Studies. North-Holland, 1973.