The SCEAS System
Navigation Menu

Search the dblp DataBase


Graham Hutton: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Graham Hutton
    Parsing Using Combinators. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1989, pp:353-370 [Conf]
  2. Graham Hutton, Ed Voermans
    Making Functionality More General. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1991, pp:177-190 [Conf]
  3. Erik Meijer, Graham Hutton
    Bananas in Space: Extending Fold and Unfold to Exponential Types. [Citation Graph (0, 0)][DBLP]
    FPCA, 1995, pp:324-333 [Conf]
  4. Graham Hutton, M. Cripps, Dave Elliman, Colin Higgins
    A Strategy for On-line Interpretation of Sketched Engineering Drawings. [Citation Graph (0, 0)][DBLP]
    ICDAR, 1997, pp:771-775 [Conf]
  5. Graham Hutton
    Fold and Unfold for Program Semantics. [Citation Graph (0, 0)][DBLP]
    ICFP, 1998, pp:280-288 [Conf]
  6. Catherine Hope, Graham Hutton
    Accurate Step Counting. [Citation Graph (0, 0)][DBLP]
    IFL, 2005, pp:91-105 [Conf]
  7. Carolyn Brown, Graham Hutton
    Categories, Allegories and Circuit Design [Citation Graph (0, 0)][DBLP]
    LICS, 1994, pp:372-381 [Conf]
  8. Graham Hutton, Joel Wright
    Compiling Exceptions Correctly. [Citation Graph (0, 0)][DBLP]
    MPC, 2004, pp:211-227 [Conf]
  9. Jeremy Gibbons, Graham Hutton, Thorsten Altenkirch
    When is a function a fold or an unfold? [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:44, n:1, pp:- [Journal]
  10. Graham Hutton
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:41, n:1, pp:- [Journal]
  11. Jeremy Gibbons, Graham Hutton
    Proof Methods for Corecursive Programs. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:66, n:4, pp:353-366 [Journal]
  12. Graham Hutton, Jeremy Gibbons
    The generic approximation lemma. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:79, n:4, pp:197-201 [Journal]
  13. Graham Hutton
    The countdown problem. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2002, v:12, n:6, pp:609-616 [Journal]
  14. Graham Hutton
    Higher-Order Functions for Parsing. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1992, v:2, n:3, pp:323-343 [Journal]
  15. Graham Hutton
    Book Review: Introduction to HOL: A Theorem Proving Environment for Higher Order Logic by Mike Gordon and Tom Melham (eds.), Cambridge University Press, 1993, ISBN 0-521-44189-7. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1994, v:4, n:4, pp:557-559 [Journal]
  16. Graham Hutton
    A Tutorial on the Universality and Expressiveness of Fold. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1999, v:9, n:4, pp:355-372 [Journal]
  17. Graham Hutton, Erik Meijer
    Back to Basics: Deriving Representation Changers Functionally. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1996, v:6, n:1, pp:181-188 [Journal]
  18. Graham Hutton, Erik Meijer
    Monadic Parsing in Haskell. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1998, v:8, n:4, pp:437-444 [Journal]
  19. Graham Hutton, Joel Wright
    Calculating an exceptional machine. [Citation Graph (0, 0)][DBLP]
    Trends in Functional Programming, 2004, pp:49-64 [Conf]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002