Perfect trees and bit-reversal permutations

Journal of Functional Programming

Volumn 10, Issue 3, 2000, Pages 305-317

  Hinze, Ralf ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0348116825     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796800003701     Document Type: Article

References (16)

1. Bird, R. (1998) Introduction to Functional Programming using Haskell. 2nd ed. Prentice Hall.
2. Bird, R. and Meertens, L. (1998) Nested datatypes. In: Jeuring, J. (editor), 4th International Conference on Mathematics of Program Construction, MPC'98, pp. 52-67. Marstrand, Sweden. Lecture Notes in Computer Science 1422. Springer-Verlag.
3. Bird, R. and Paterson, R. (1999) Generalised folds for nested datatypes. Formal Aspects of Computing. 11(2), 200-222, September 1999.
4. Bird, R. S. (1997) Functional Pearl: On building trees with minimum height. J. Functional Programming, 7(4), 441-445.
5. Braun, W. and Rem, M. (1983) A logarithmic implementation of flexible arrays. Memorandum MR83/4, Eindhoven University of Technology.
6. Dielissen, V. J. and Kaldewaij, A. (1995) A simple, efficient, and flexible implementation of flexible arrays. 3rd International Conference on Mathematics of Program Construction, MPC'95. Lecture Notes in Computer Science 947, pp. 232-241. Springer-Verlag.
7. Henglein, F. (1993). Type inference with polymorphic recursion. ACM Trans. Programming Languages and Systems, 15(2), 253-289.
8. Jones, M. P. and Peterson, J. C. (1999) Hugs 98 user manual. Available from http://www.haskell.org/hugs.
9. McCracken, N. J. (1984) The typechecking of programs with implicit type structure. In: Kahn, G., MacQueen, D. B. and Plotkin, G. D. (editors), Semantics of Data Types: International Symposium, Sophia-Antipolis, France. Lecture Notes in Computer Science 173, pp. 301-315. Springer-Verlag.
10. 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, pp. 124-144. Cambridge, MA, USA. Lecture Notes in Computer Science 523. Springer-Verlag.
11. Meijer, E. and Hutton, G. (1995) Bananas in space: Extending fold and unfold to exponential types. 7th ACM SIGPLAN/SIGARCH and IFIP WG 2.8 International Conference on Functional Programming Languages and Computer Architecture, FPCA'95, pp. 324-333. La Jolla, San Diego, CA, USA. ACM-Press.
12. 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, pp. 217-228. Toulouse, France. Lecture Notes in Computer Science 167. Springer-Verlag.
13. Paulson, L. C. (1996) ML for the Working Programmer. 2nd edn. Cambridge University Press.
14. Peyton Jones, Simon. (1998) Explicit quantification in Haskell. URL: http://research.microsoft.com/Users/simonpj/Haskell/quantification.html.
15. Peyton Jones, S. and Hughes, J. (editors) (1999) Haskell 98 - A non-strict, purely functional language. URL: http://www.haskell.org/definition
16. Wadler, P. (1989) Theorems for free! 4th International Conference on Functional Programming Languages and Computer Architecture, FPCA'89, pp. 347-359. London, UK. ACM-Press.