[1] M. E. O'Neill, and F. W. Burton, A new method for functional arrays. To appear.

[2] F. W.Burton and D. J. Simpson. Space efficient execution of deterministic parallel programs. To appear.

[3] F. W. Burton, Guaranteeing good memory bounds for parallel programs. To appear.

[4] J. Peterson (editor), K. Hammond (editor), L. Augustsson, B.Boutel,. Burton, J. Fasel, A. D. Gordon, J. Hughes, P. Hudak, T. Johnsson, Jones, M., S. Peyton Jones, A. Reid, and P. Wadler. Haskell 1.3: A Non-strict, Purely Functional Language, Yale University Research Report YALEU/DCS/RR-1106, May 1, 1996.

[5] V. J. Rayward-Smith, F. W. Burton, and G. J. Janacek. Scheduling parallel programs assuming preallocation. In Chretienne, P., Coffman, E. G., Lenstra, J. K. and Liu, Z. (Eds.),Proc. Scheduling Theory and its Applications, Charpter 7. John Wiley & Sons, 1995, pp. 145-165.

[6] W. K.Jackson, and F. W. Burton. A definite and unfoldable, partially deterministic language. Computer Journal 37(8):711-714, 1994. [7] F. W. Burton and V. J. Rayward-Smith. Worst case scheduling for parallel functional programming. Journal of Functional Programming. 4(1):65-75, April 1994.

[8] F. W. Burton and R. D. Cameron. Pattern matching with abstract data types. Journal of Functional Programming, 3(2):171-190, April 1993.

[9] W. K. Jackson and F. W. Burton. Improving Intervals. Journal of Functional Programming 3(2):153-169, April 1993.

[10] F. W. Burton and R. L. Page. Distributed random number generation. Journal of Functional Programming 2(2):203-212, April 1992.

[11] F. W. Burton. Encapsulating nondeterminacy in an abstract data type with deterministic semantics. Journal of Functional Programming 1(1):3-20, January 1991.

[12] F. W. Burton and H. K. Yang. Manipulating multi-linked data structures in a pure functional language. Software Practice and Experience 20(11):1167-1185, November 1990.

[13] F. W. Burton, G. P. McKeown and V. J. Rayward-Smith. Applications of UET scheduling theory to the implementation of declarative languages. Computer Journal 33(4):330-336, August 1990.

[14] F. W. Burton. Type extension through polymorphism, ACM Trans. Program. Lang. Sys. 12(1):135-138, January 1990.

[15] F. W. Burton. A note on higher order functions versus logical variables. Info. Processing Letters 31(2):91-95, April 26, 1989.

[16] F. W. Burton and J. G. Kollias. Functional programming and quadtrees. IEEE Software 6(1):90-97, January 1989.

[17] F. W. Burton, G. P. McKeown, and V. J. Rayward-Smith. On process assignment in parallel computing. Info. Processing Letters 29:31-34, September 1988.

[18] F. W. Burton. Nondeterminism with referential transparency in functional programming languages. Computer Journal 31(3):243-247.

[19] F. W. Burton. Storage management in virtual tree machines. IEEE Trans. Comp. 37(3):321-328, March 1988.

[20] M. M. Huntbach and F. W. Burton. Alpha-beta search on virtual tree machines. Information Sciences 44:3-17, 1988.

[21] F. W. Burton, D. Maurer, H. G. Oberhauser and R. A. Wilhelm. A space efficient optimization of call-by-need. IEEE Trans. Software Eng.

[22] F. W. Burton Speculative computation, parallelism, and functional programming. IEEE Trans. Computing C-34(12):1190-1193, December 1985.

[23] F. W. Burton. Annotations to control parallelism and reduction order in the distributed evaluation of functional programs. ACM Trans. Program. Lang. Syst. 6(2):159-174, April 1984.

[24] F. W. Burton and M. M. Huntbach. Virtual Tree machines. IEEE Trans. Computing C-33(3):278-280, March 1984.

Back to Dr. Burton's Home Page