Manufacturing datatypes

Journal of Functional Programming

Volumn 11, Issue 5, 2001, Pages 493-524

  Hinze, Ralf ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035615503     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S095679680100404X     Document Type: Article

References (28)

1. Adel'son-Vel'skiǐ, G. and Landis, Y. (1962) An algorithm for the organization of information. Doklady Akademiia Nauk SSSR 146:263-266. (English translation in Soviet Math. Dokl. 3, 1259-1263.)
2. Adel'son-Vel'skiǐ, G. and Landis, Y. (1962) An algorithm for the organization of information. Doklady Akademiia Nauk SSSR 146:263-266. (English translation in Soviet Math. Dokl. 3, 1259-1263.)
3. Aho, A. V., Hopcroft, J. E. and Ullman, J. D. (1983) Data Structures and Algorithms. Addison-Wesley.
4. Bird, R. and de Moor, O. (1997) Algebra of Programming. Prentice Hall Europe.
5. Bird, R. and Meertens, L. (1998) Nested datatypes. In: Jeuring, J. (editor), Fourth International Conference on Mathematics of Program Construction, MPC'98, Marstrand, Sweden. Lecture Notes in Computer Science 1422, pp. 52-67. Springer-Verlag.
6. Braun, W. and Rem, M. (1983) A logarithmic implementation of flexible arrays. Memorandum MR83/4, Eindhoven University of Technology.
7. Cormen, T. H., Leiserson, C. E. and Rivest, R. L. (1991) Introduction to Algorithms. MIT Press.
8. Dielissen, V. J. and Kaldewaij, A. (1995) A simple, efficient, and flexible implementation of flexible arrays. Third International Conference on Mathematics of Program Construction, MPC'95, Kloster Irsee, Germany. Lecture Notes in Computer Science 947, pp. 232-241. Springer-Verlag.
9. Guibas, L. J. and Sedgewick, R. (1978) A diochromatic framework for balanced trees. Proceedings 19th Animal Symposium on Foundations of Computer Science pp. 8-21. IEEE Computer Society.
10. Hinze, R. (1998) Numerical Representations as Higher-Order Nested Datatypes. Technical report IAI-TR-98-12, Institut für Informatik III, Universität Bonn.
11. Hinze, R. (1999) Constructing red-black trees. In: Okasaki, C. (editor), Proceedings of the Workshop on Algorithmic Aspects of Advanced Programming Languages, WAAAPL'99, Paris, France pp. 89-99. (The proceedings appeared as a technical report of Columbia University, CUCS-023-99, also available from http://www.cs.columbia.edu/~cdo/waaapl.html.)
12. Hinze, R. (2000a) Functional Pearl: Perfect trees and bit-reversal permutations. J. Functional Programming, 10(3), 305-317.
13. Hinze, R. (2000b) A new approach to generic functional programming. In: Reps, T. W. (editor), Proceedings 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL' 00), Boston, MA, pp. 119-132.
14. Hinze, R. (2000c) Polytypic programming with ease. J. Functional and Logic Programming. To appear.
15. Hoogendijk, P. and de Moor, O. (2000) Container types categorically. J. Functional Programming, 10(2), 91-225.
16. Jones, M. P. (1995) Functional programming with overloading and higher-order polymorphism. In: Jeuring, J. and Meijer, E. (editors), Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques, Båstad, Sweden. Lecture Notes in Computer Science 925, pp. 97-136. Springer-Verlag.
17. Leivant, D. (1983) Polymorphic type inference. Proc. 10th Symposium on Principles of Programming Languages.
18. Meijer, E., Fokkinga, M. and Paterson, R. (1991) Functional programming with bananas, lenses, envelopes and barbed wire. 5th ACM Conference on Functional Programming Languages and Computer Architecture, FPCA'91, Cambridge, MA. Lecture Notes in Computer Science 523, pp. 124-144. Springer-Verlag.
19. Mycroft, A. (1984) Polymorphic type schemes and recursive definitions. In: Paul, M. and Robinet, B. (editors), Proceedings of the International Symposium on Programming, 6th Colloquium, Toulouse, France. Lecture Notes in Computer Science 167, pp. 217-228.
20. Okasaki, C. (1997) Functional Pearl: Three algorithms on Braun trees. J. Functional Programming 7(6), 661-666.
21. Okasaki, C. (1998) Purely Functional Data Structures. Cambridge University Press.
22. Okasaki, C. (1999) From fast exponentiation to square matrices: An adventure in types. In: Lee, P. (editor), Proceedings of the 1999 ACM SIGPLAN International Conference on Functional Programming, Paris, France, pp. 28-35.
23. Peyton Jones, S. and Hughes, J. (eds). (1999) Haskell 98 - A Non-strict, Purely Functional Language. Available from http://www.haskell.org/definition/.
24. Snyder, L. (1977) On uniquely represented data structures (extended abstract). 18th Annual Symposium on Foundations of Computer Science, Providence, pp. 142-146. IEEE Press.
25. Williams, J. (1964) Algorithm 232: Heapsort. Comm. ACM, 7(6), 347-348.
26. Xi, H. (1999) Dependently typed data structures. In: Okasaki, C. (editor), Proceedings of the Workshop on Algorithmic Aspects of Advanced Programming Languages, WAAAPL'99, Paris, France, pp. 17-32. (The proceedings appeared as a technical report of Columbia University, CUCS-023-99, also available from http://www.es.columbia.edu/~cdo/waaapl.html.)
27. Zenger, C. (1997) Indexed types. Theor. Comput. Sci. 187(1-2), 147-165.
28. Zenger, C. (1998) Indizierte Typen. PhD thesis, Universität Karlsruhe.