GRAHAM HUTTON, MAURO JASKELIOFF and ANDY GILL, 2010. Factorising Folds for Faster Functions Journal of Functional Programming: Special Issue on Generic Programming. 20(3&4), 353-373 ANDY GILL and GRAHAM HUTTON, 2009. The Worker/Wrapper Transformation Journal of Functional Programming. 19(2), 227-251 HUTTON, G. and WRIGHT, J., 2007. What is the meaning of these constant interruptions? Journal of Functional Programming. 17(6), 777-792 HOPE, C. and HUTTON, G.M., 2006. Accurate Step Counting In: Selected papers from the 17th International Workshop on Implementation and Application of Functional Languages. HOPE, C. and HUTTON, G., 2006. Compact Fusiuon In: Proceedings of the Workshop on Mathematically Structured Functional Programming. GIBBONS, J. and HUTTON, G., 2005. Proof Methods for Corecursive Programs Fundamenta Informaticae: Special Issue on Program Transformation. 66(4), 353-366 HUTTON, G. and WRIGHT, J., 2004. Compiling exceptions correctly. In: KOZEN, D. and SHANKLAND, C., eds., Mathematics of program construction: 7th International Conference, MPC 2004, Stirling, Scotland, UK, July 12-14, 2004 Berlin: Springer. 211-227 HUTTON, G.M. and WRIGHT, J., 2004. Calculating an exceptional machine In: Symposium on Trends in Functional Programming (TFP04), Munich, Germany, 25-26 November, 2004. 49-64 HUTTON, G., 2002. The countdown problem Journal of Functional Programming. 12(6), 609-616 HUTTON, G. and GIBBONS, J., 2001. The Generic Approximation Lemma Information Processing Letters. 79(4), 197-201 GIBBONS, J. and HUTTON, G.M., 1999. 1st Scottish Functional Programming Workshop In: Proof Methods for Structured Corecursive Programs.
HUTTON, G., 1999. A tutorial on the universality and expressiveness of fold Journal of Functional Programming. VOL 9(NUMBER 4), 355-372 HUTTON, G.M., 1998. Fold and Unfold for Program Semantics In: Proceedings of the 3rd ACM SIGPLAN.
HUTTON, G. and MEIJER, E., 1998. Monadic parsing in Haskell Journal of Functional Programming. VOL 8(NUMBER 4), 437-444 HUTTON, G.M., 1996. Monadic Parser Combinators University of Nottingham, Nottingham.
HUTTON, G. and MEIJER, E., 1996. Back to basics: Deriving representation changers functionally Journal of Functional Programming. VOL 6(NUMBER 1), 181-188
HUTTON, G.M., 1995. Review of "An Introduction to HOL" Journal of Functional Programming. 4((4)), 557-559
HUTTON, G.M., 1995. Bananas in Space: Extending Fold and Unfold Exponential Types In: Proceedings of the 7th SIGPLAN-Sigarch-WG2.8 International Conference on Functional Programming and Computer Architecture.
HUTTON, G.M. and BROWN, C., 1994. Categories, allegories and circuit design In: Proceedings of the 10th Annual IEEE symposium on Logic in Computer Science.
HUTTON, G.M., 1993. The Ruby Interpreter (72)
HUTTON, G.M., 1992. Higher-order Functions for Parsing Journal of Functional Programming. 2((3)), 323-343
HUTTON, G.M., 1992. Between Functions and Relations in Calculating Programs University of Glasgow, Glasgow, UK. (FP-93-5)
HUTTON, G.M., 1992. A Calculational Theory of Pers as Types University of Glasgow, Glasgow, UK. (R1)
HUTTON, G.M., 1992. A Relational Derivation of a Functional Program In: STOP Summer School on Constructive Algorithmics.
HUTTON, G.M., 1992. A Relational Derivation of a Functional Program In: STOP Summer School on Constructive Algorithmics.
HUTTON, G.M., 1992. Making Functionality More General In: Proceedings of the 1991 Glasgow Workshop on Functional Programming.
HUTTON, G.M., 1991. Functional Programming With Relations In: Proceedings of the 1990 Glasgow Workshop on Functional Programming.