The sketch of a polymorphic symphony

Electronic Notes in Theoretical Computer Science

Volumn 70, Issue 6, 2002, Pages 135-155

  Lämmel, Ralf ^a,b  

^a CWI   (Netherlands)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; DATA STRUCTURES; FUNCTIONS; INTEGER PROGRAMMING; PARAMETER ESTIMATION;

FUNCTIONAL STRATEGIES; GENERIC PROGRAMMING; HAKELL-BASED MODEL; STRATEGIC PROGRAMMING;

COMPUTER SCIENCE;

EID: 0141776893     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80604-2     Document Type: Conference Paper

References (28)

1. Abadi M., Cardelli L., Pierce B., Plotkin G. Dynamic Typing in a Statically Typed Language. ACM Transactions on Programming Languages and Systems. 13:(2):Apr. 1991;237-268
2. M. Abadi, L. Cardelli, B. Pierce, and D. Rémy. Dynamic Typing in Polymorphic Languages. In Proceedings of the 1992 ACM Workshop on ML and its Applications, pages 92-103, San Francisco, June 1992. Association for Computing Machinery.
3. Borovanský P., Kirchner C., Kirchner H., Ringeissen C. Rewriting with strategies in ELAN: a functional semantics. International Journal of Foundations of Computer Science. 12:(1):2001;69-95
4. M. Brand, P. Klint, and J. Vinju. Term rewriting with traversal functions. Technical Report SEN-R0121, CWI, July 2001.
5. J. Cockett and D. Spencer. Strong categorical datatypes I. In R. Seely, editor, Proceedings Int. Summer Category Theory Meeting, Montréal, Québec, 23-30 June 1991, volume 13 of Canadian Mathematical Society Conf. Proceedings, pages 141-169. American Mathematical Society, Providence, RI, 1992.
6. E. Dolstra and E. Visser. First-class rules and generic traversal. Technical report, Universiteit Utrecht, UU-CS-2001-38, 2001. Technical report.
7. J.-Y. Girard. Interprétation fonctionelle et élimination des coupures dans l'arithétique d'ordre supérieur. PhD thesis, Université Paris VII, 1972.
8. R. Harper and G. Morrisett. Compiling polymorphism using intentional type analysis. In Conference Record of POPL '95: 22nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, Calif., pages 130-141. ACM, Jan. 1995.
9. Jeuring J., Jansson P. Polytypic programming. Launchbury J., Meijer E., Sheard T. 2nd Int. School on Advanced Functional Programming, Olympia, WA, USA, 26-30 Aug 1996. volume 1129 of LNCS :1996;68-114 Springer-Verlag, Berlin
10. Jones M. Functional Programming with Overloading and Higher-Order Polymorphism. Jeuring J., Meijer E. Advanced Functional Programming. volume 925 of LNCS :1995;97-136 Springer-Verlag
11. M. Jones. First-class polymorphism with type inference. In Conference Record of POPL '97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 483-496, Paris, France, 15-17 Jan. 1997.
12. Lämmel R. Typed Generic Traversal With Term Rewriting Strategies. Journal of Logic and Algebraic Programming. 54:September 2002
13. R. Lämmel and J. Visser. Type-safe Functional Strategies. In Draft proc. of SEP'00, St Andrews, July 2000.
14. R. Lämmel and J. Visser. Typed Combinators for Generic Traversal. In S. Krishnamurthi and C. Ramakrishnan, editors, Proc. of PADL'02, volume 2257 of LNCS, pages 137-154. Springer-Verlag, Jan. 2002.
15. R. Lämmel, J. Visser, and J. Kort. Dealing with Large Bananas. In J. Jeuring, editor, Proc. of WGP'2000, Technical Report, Universiteit Utrecht, pages 46-59, July 2000.
16. Lieberherr K. Adaptive Object-Oriented Software: The Demeter Method with Propagation Patterns. 1996;PWS Publishing Company, Boston
17. Meertens L. Paramorphisms. Formal Aspects of Computing. 4:(5):1992;413-424
18. E. Meijer, M. Fokkinga, and R. Paterson. Functional Programming with Bananas, Lenses, Envelopes, and Barbed Wire. In J. Hughes, editor, Functional Programming Languages and Computer Architecture, 5th ACM Conference, Cambridge, MA, USA, August 26-30, 1991, Proceedings, volume 523 of LNCS, pages 124-144. Springer-Verlag, 1991.
19. S. Peyton Jones and J. Hughes (eds.). Haskell 98: A non-strict, purely functional language. http://www.haskell.org/onlinereport/, 1999.
20. J. Reynolds. Towards a Theory of Type Structures. In Programming Symposium (Colloque sur la Programmation, Paris), volume 19 of LNCS, pages 408-425. Springer-Verlag, 1974.
21. J. Reynolds. Types, abstraction and parametric polymorphism. In R. E. A. Mason, editor, Proc. of 9th IFIP World Computer Congress, Information Processing '83, Paris, France, 19-23 Sept 1983, pages 513-523. North-Holland, Amsterdam, 1983.
22. S. Thompson. Higher-order + Polymorphic = Reusable. Unpublished; http://www.cs.ukc.ac.uk/pubs/1997/224, May 1997.
23. E. Visser, Z.-e.-A. Benaissa, and A. Tolmach. Building Program Optimizers with Rewriting Strategies. In Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP'98), pages 13-26. ACM Press, September 1998.
24. P. Wadler. Theorems for free! In Proceedings 4th Int. Conf. on Funct. Prog. Languages and Computer Arch., FPCA'89, London, UK, 11-13 Sept 1989, pages 347-359. ACM Press, 1989.
25. P. Wadler. The essence of functional programming. In ACM, editor, Conference record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Albuquerque, New Mexico, pages 1-14. ACM Press, 1992.
26. P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad hoc. In ACM SIGPLAN-SIGACT, editor, Conference Record of the 16th Annual ACM Symposium on Principles of Programming Languages (POPL '89), pages 60-76, Austin, TX, USA, Jan. 1989. ACM Press.
27. S. Weirich. Type-safe cast. In ACM SIGPLAN International Conference on Functional Programming (ICFP'00), pages 58-67, Montreal, Sept. 2000. ACM Press.
28. S. Weirich. Higher-Order Intensional Type Analysis. In D. L. Métayer, editor, Programming Languages and Systems: 11th European Symposium on Programming, ESOP 2002, Grenoble, France, number 2305 in LNCS, pages 98-114, 2002.