Coercion as homomorphism: Type inference in a system with subtyping and overloading

Proceedings of the ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'02)

Volumn , Issue , 2002, Pages 14-25

  Shafarenko, Alex ^a  

^a NONE

Author keywords

Array processing; Data parallel programming; Overloading; Subtyping; Type inference

Indexed keywords

COMPUTATIONAL METHODS; DATA STRUCTURES; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SEMANTICS;

ARRAY OPERATIONS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0036989083     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. L.Cardelli and P.Wegner. On understanding types, data abstraction, and polymorphism. Computing Surveys, 17(4):471-522, 1985.
2. J.Mitchell. Type inference with simple subtypes. Journal of Functional Programming, 1:245-285, 1991.
3. D. Lievant Discrete Polymorphism. Proc. 1990 ACM Conference on LISP and Functional Programming, pp. 288-297, 1990.
4. I. Foster, C. Kesselman and S Tuecke. The Anatomy of the Grid. Enabling Scalable Virtual Organisations. Intl. J. Supercomputer Applications, 2001. Also see citeseer.nj.nec.com/492895.html.
5. A.Shafarenko. RETRAN: a Recurrent Paradigm for Data-Parallel Computing. Computer Systems Science and Engineering, vol 11, No 4, July 1996, pp 201-209.
6. J.C.Reynolds. Three approaches to type structure. In: TAPSOFT proceedings, LNCS vol 185, pp.97-138, 1985.
7. J.Eifrig, S.Smith and V.Trifonov. Type inference for recursively constrained types and its application to OOP. Theoretical Computer Science, December 1995, vol. 152, no 2, p. 326-345.
8. J. Matocha and T. Camp, A Taxonomy of Distributed Termination Detection Algorithms, The Journal of Systems and Software, vol. 43, no. 3, pp 207-221, 1998.
9. A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, 1998.