default search action
Graham Hutton
Person information
- affiliation: University of Nottingham, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j47]Graham Hutton:
PhD Abstracts. J. Funct. Program. 34 (2024) - [j46]Patrick Bahr, Graham Hutton:
Beyond Trees: Calculating Graph-Based Compilers (Functional Pearl). Proc. ACM Program. Lang. 8(ICFP): 370-394 (2024) - [j45]Brandon Hewer
, Graham Hutton
Quotient Haskell: Lightweight Quotient Types for All. Proc. ACM Program. Lang. 8(POPL): 785-815 (2024) - [c30]Zac Garby
Calculating Compilers Effectively (Functional Pearl). Haskell 2024: 109-119 - 2023
- [j44]Graham Hutton
Programming language semantics: It's easy as 1,2,3. J. Funct. Program. 33 (2023) - [j43]Graham Hutton:
PhD Abstracts. J. Funct. Program. 33 (2023) - [j42]Graham Hutton:
PhD Abstracts. J. Funct. Program. 33 (2023) - [j41]Patrick Bahr
Calculating Compilers for Concurrency. Proc. ACM Program. Lang. 7(ICFP): 740-767 (2023) - [e5]Michael Sperber, Graham Hutton:
Proceedings of the 1st ACM SIGPLAN International Workshop on Functional Software Architecture, FUNARCH 2023, Seattle, WA, USA, 8 September 2023. ACM 2023 [contents] - 2022
- [j40]Graham Hutton:
PhD Abstracts. J. Funct. Program. 32: e17 (2022) - [j39]Graham Hutton:
PhD Abstracts. J. Funct. Program. 32: e2 (2022) - [j38]Graham Hutton:
PhD Abstracts. J. Funct. Program. 32: e7 (2022) - [j37]Patrick Bahr
Monadic compiler calculation (functional pearl). Proc. ACM Program. Lang. 6(ICFP): 80-108 (2022) - [c29]Brandon Hewer, Graham Hutton
Subtyping Without Reduction. MPC 2022: 34-61 - 2021
- [j36]Graham Hutton:
PhD Abstracts. J. Funct. Program. 31: e1 (2021) - [j35]Graham Hutton:
PhD Abstracts. J. Funct. Program. 31: e14 (2021) - [j34]Mitchell Pickard, Graham Hutton
Calculating dependently-typed compilers (functional pearl). Proc. ACM Program. Lang. 5(ICFP): 1-27 (2021) - 2020
- [j33]Graham Hutton:
PhD Abstracts. J. Funct. Program. 30: e1 (2020) - [j32]Graham Hutton:
PhD Abstracts. J. Funct. Program. 30: e18 (2020) - [j31]Patrick Bahr
Calculating correct compilers II: Return of the register machines. J. Funct. Program. 30: e25 (2020) - [j30]Martin A. T. Handley, Niki Vazou, Graham Hutton
Liquidate your assets: reasoning about resource usage in liquid Haskell. Proc. ACM Program. Lang. 4(POPL): 24:1-24:27 (2020)
2010 – 2019
- 2019
- [j29]Graham Hutton:
PhD Abstracts. J. Funct. Program. 29: e1 (2019) - [j28]Graham Hutton:
PhD Abstracts. J. Funct. Program. 29: e10 (2019) - [j27]Jennifer Hackett, Graham Hutton
Call-by-need is clairvoyant call-by-value. Proc. ACM Program. Lang. 3(ICFP): 114:1-114:23 (2019) - [e4]Graham Hutton:
Mathematics of Program Construction - 13th International Conference, MPC 2019, Porto, Portugal, October 7-9, 2019, Proceedings. Lecture Notes in Computer Science 11825, Springer 2019, ISBN 978-3-030-33635-6 [contents] - 2018
- [j26]Graham Hutton:
PhD Abstracts. J. Funct. Program. 28: e17 (2018) - [j25]Jennifer Hackett, Graham Hutton
Parametric polymorphism and operational improvement. Proc. ACM Program. Lang. 2(ICFP): 68:1-68:24 (2018) - [c28]Martin A. T. Handley, Graham Hutton
AutoBench: comparing the time performance of Haskell programs. Haskell@ICFP 2018: 26-37 - [c27]Niki Vazou
Theorem proving for all: equational reasoning in liquid Haskell (functional pearl). Haskell@ICFP 2018: 132-144 - [c26]Martin A. T. Handley, Graham Hutton
Improving Haskell. TFP 2018: 114-135 - [i1]Niki Vazou, Joachim Breitner, Will Kunkel, David Van Horn, Graham Hutton:
Functional Pearl: Theorem Proving for All (Equational Reasoning in Liquid Haskell). CoRR abs/1806.03541 (2018) - 2017
- [j24]Graham Hutton:
PhD Abstracts. J. Funct. Program. 27: e16 (2017) - [j23]Graham Hutton
Compiling a 50-year journey. J. Funct. Program. 27: e20 (2017) - [j22]Graham Hutton:
PhD Abstracts. J. Funct. Program. 27: e25 (2017) - [c25]Jonathan Fowler, Graham Hutton
Failing Faster: Overlapping Patterns for Property-Based Testing. PADL 2017: 103-119 - 2016
- [j21]Graham Hutton:
PhD Abstracts. J. Funct. Program. 26: e24 (2016) - [j20]Graham Hutton:
PhD Abstracts. J. Funct. Program. 26: e8 (2016) - [c24]Graham Hutton
Cutting Out Continuations. A List of Successes That Can Change the World 2016: 187-200 - [c23]Venanzio Capretta
Contractive Functions on Infinite Data Structures. IFL 2016: 5:1-5:13 - 2015
- [j19]Patrick Bahr
Calculating correct compilers. J. Funct. Program. 25 (2015) - [j18]Graham Hutton:
PhD abstracts. J. Funct. Program. 25 (2015) - [j17]Graham Hutton:
PhD Abstracts. J. Funct. Program. 25 (2015) - [j16]Graham Hutton:
PhD Abstracts. J. Funct. Program. 25 (2015) - [c22]Jennifer Hackett, Graham Hutton
Programs for Cheap! LICS 2015: 115-126 - [c21]Jonathan Fowler, Graham Hutton:
Towards a Theory of Reach. TFP 2015: 22-39 - 2014
- [j15]Neil Sculthorpe, Graham Hutton
Work it, wrap it, fix it, fold it. J. Funct. Program. 24(1): 113-127 (2014) - [j14]Graham Hutton:
PhD Abstracts. J. Funct. Program. 24(4): 474-522 (2014) - [j13]Hans-Juergen Boehm, Jack W. Davidson, Kathleen Fisher, Cormac Flanagan, Jeremy Gibbons, Mary W. Hall
Practices of PLDI. ACM SIGPLAN Notices 49(4S): 33-38 (2014) - [c20]Jennifer Hackett, Graham Hutton
Worker/wrapper/makes it/faster. ICFP 2014: 95-107 - 2013
- [c19]Jennifer Hackett, Graham Hutton, Mauro Jaskelioff:
The Under-Performing Unfold: A new approach to optimising corecursive programs. IFL 2013: 1 - [c18]Laurence E. Day, Graham Hutton
Compilation à la Carte. IFL 2013: 13 - 2012
- [j12]Graham Hutton:
SIGPLAN vice-chair's report. ACM SIGPLAN Notices 47(4a): 3 (2012) - 2011
- [c17]Laurence E. Day, Graham Hutton
Towards Modular Compilers for Effects. Trends in Functional Programming 2011: 49-64 - 2010
- [j11]Graham Hutton
Factorising folds for faster functions. J. Funct. Program. 20(3-4): 353-373 (2010)
2000 – 2009
- 2009
- [j10]Andy Gill, Graham Hutton
The worker/wrapper transformation. J. Funct. Program. 19(2): 227-251 (2009) - [c16]Liyang Hu, Graham Hutton:
Compiling Concurrency Correctly: Cutting out the Middle Man. Trends in Functional Programming 2009: 17-32 - [e3]Graham Hutton, Andrew P. Tolmach:
Proceeding of the 14th ACM SIGPLAN international conference on Functional programming, ICFP 2009, Edinburgh, Scotland, UK, August 31 - September 2, 2009. ACM 2009, ISBN 978-1-60558-332-7 [contents] - 2008
- [c15]Liyang Hu, Graham Hutton:
Towards a Verified STM. Trends in Functional Programming 2008: 129-144 - [c14]Mauro Jaskelioff, Neil Ghani, Graham Hutton
Modularity and Implementation of Mathematical Operational Semantics. MSFP@ICALP 2008: 75-95 - 2007
- [j9]Graham Hutton
What is the meaning of these constant interruptions? J. Funct. Program. 17(6): 777-792 (2007) - 2006
- [c13]Catherine Hope, Graham Hutton:
Compact Fusion. MSFP@MPC 2006 - 2005
- [j8]Jeremy Gibbons, Graham Hutton:
Proof Methods for Corecursive Programs. Fundam. Informaticae 66(4): 353-366 (2005) - [c12]Catherine Hope, Graham Hutton
Accurate Step Counting. IFL 2005: 91-105 - 2004
- [c11]Graham Hutton
Compiling Exceptions Correctly. MPC 2004: 211-227 - [c10]Graham Hutton, Joel J. Wright:
Calculating an exceptional machine. Trends in Functional Programming 2004: 49-64 - 2002
- [j7]Graham Hutton
The countdown problem. J. Funct. Program. 12(6): 609-616 (2002) - 2001
- [j6]Graham Hutton
The generic approximation lemma. Inf. Process. Lett. 79(4): 197-201 (2001) - [c9]Jeremy Gibbons
When is a function a fold or an unfold? CMCS 2001: 146-160 - 2000
- [c8]Graham Hutton
Preface. Haskell 2000: 2 - [e2]Graham Hutton:
Proceedings of the 2000 ACM SIGPLAN Workshop on Haskell, Haskell 2000, Satellite Event of PLI 2000, Montreal, Canada, September 17, 2000. Electronic Notes in Theoretical Computer Science 41(1), Elsevier 2000 [contents]
1990 – 1999
- 1999
- [j5]Graham Hutton
A Tutorial on the Universality and Expressiveness of Fold. J. Funct. Program. 9(4): 355-372 (1999) - 1998
- [j4]Graham Hutton
Monadic Parsing in Haskell. J. Funct. Program. 8(4): 437-444 (1998) - [c7]Graham Hutton
Fold and Unfold for Program Semantics. ICFP 1998: 280-288 - 1997
- [c6]Graham Hutton, M. Cripps, Dave Elliman, Colin Higgins:
A Strategy for On-line Interpretation of Sketched Engineering Drawings. ICDAR 1997: 771-775 - 1996
- [j3]Graham Hutton, Erik Meijer:
Back to Basics: Deriving Representation Changers Functionally. J. Funct. Program. 6(1): 181-188 (1996) - 1995
- [c5]Erik Meijer, Graham Hutton:
Bananas in Space: Extending Fold and Unfold to Exponential Types. FPCA 1995: 324-333 - 1994
- [j2]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. J. Funct. Program. 4(4): 557-559 (1994) - [c4]Carolyn Brown, Graham Hutton:
Categories, Allegories and Circuit Design. LICS 1994: 372-381 - 1992
- [b1]Graham Hutton:
Between functions and relations in calculating programs. University of Glasgow, UK, 1992 - [j1]Graham Hutton
Higher-Order Functions for Parsing. J. Funct. Program. 2(3): 323-343 (1992) - 1991
- [c3]Graham Hutton, Ed Voermans:
Making Functionality More General. Functional Programming 1991: 177-190 - [e1]Simon L. Peyton Jones, Graham Hutton, Carsten Kehler Holst:
Proceedings of the 1990 Glasgow Workshop on Functional Programming, Ullapool, Scotland, UK, August 13-15, 1990. Workshops in Computing, Springer 1991, ISBN 978-3-540-19667-9 [contents] - 1990
- [c2]Graham Hutton:
Functional Programming with Relations. Functional Programming 1990: 126-140
1980 – 1989
- 1989
- [c1]Graham Hutton:
Parsing Using Combinators. Functional Programming 1989: 353-370
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-22 19:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: