Graham Hutton

Orcid: 0000-0001-9584-5150

Affiliations:
  • University of Nottingham, UK


According to our database1, Graham Hutton authored at least 57 papers between 1989 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Quotient Haskell: Lightweight Quotient Types for All.
Proc. ACM Program. Lang., January, 2024

2023
Calculating Compilers for Concurrency.
Proc. ACM Program. Lang., August, 2023

Programming language semantics: It's easy as 1,2,3.
J. Funct. Program., 2023

2022
Monadic compiler calculation (functional pearl).
Proc. ACM Program. Lang., 2022

Subtyping Without Reduction.
Proceedings of the Mathematics of Program Construction - 14th International Conference, 2022

2021
Calculating dependently-typed compilers (functional pearl).
Proc. ACM Program. Lang., 2021

2020
Liquidate your assets: reasoning about resource usage in liquid Haskell.
Proc. ACM Program. Lang., 2020

Calculating correct compilers II: Return of the register machines.
J. Funct. Program., 2020

2019
Call-by-need is clairvoyant call-by-value.
Proc. ACM Program. Lang., 2019

2018
Parametric polymorphism and operational improvement.
Proc. ACM Program. Lang., 2018

Functional Pearl: Theorem Proving for All (Equational Reasoning in Liquid Haskell).
CoRR, 2018

Improving Haskell.
Proceedings of the Trends in Functional Programming - 19th International Symposium, 2018

Theorem proving for all: equational reasoning in liquid Haskell (functional pearl).
Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell, 2018

AutoBench: comparing the time performance of Haskell programs.
Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell, 2018

2017
Compiling a 50-year journey.
J. Funct. Program., 2017

Failing Faster: Overlapping Patterns for Property-Based Testing.
Proceedings of the Practical Aspects of Declarative Languages, 2017

2016
Contractive Functions on Infinite Data Structures.
Proceedings of the 28th Symposium on the Implementation and Application of Functional Programming Languages, 2016

Cutting Out Continuations.
Proceedings of the A List of Successes That Can Change the World, 2016

2015
Calculating correct compilers.
J. Funct. Program., 2015

Towards a Theory of Reach.
Proceedings of the Trends in Functional Programming - 16th International Symposium, 2015

Programs for Cheap!
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014
Practices of PLDI.
ACM SIGPLAN Notices, 2014

Work it, wrap it, fix it, fold it.
J. Funct. Program., 2014

PhD Abstracts.
J. Funct. Program., 2014

Worker/wrapper/makes it/faster.
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 2014

2013
The Under-Performing Unfold: A new approach to optimising corecursive programs.
Proceedings of the 25th Symposium on Implementation and Application of Functional Languages, 2013

Compilation à la Carte.
Proceedings of the 25th Symposium on Implementation and Application of Functional Languages, 2013

2012
SIGPLAN vice-chair's report.
ACM SIGPLAN Notices, 2012

2011
Towards Modular Compilers for Effects.
Proceedings of the Trends in Functional Programming, 12th International Symposium, 2011

2010
Factorising folds for faster functions.
J. Funct. Program., 2010

2009
The worker/wrapper transformation.
J. Funct. Program., 2009

Compiling Concurrency Correctly: Cutting out the Middle Man.
Proceedings of the Tenth Symposium on Trends in Functional Programming, 2009

2008
Modularity and Implementation of Mathematical Operational Semantics.
Proceedings of the Second Workshop on Mathematically Structured Functional Programming, 2008

Towards a Verified STM.
Proceedings of the Nineth Symposium on Trends in Functional Programming, 2008

2007
What is the meaning of these constant interruptions?
J. Funct. Program., 2007

2006
Compact Fusion.
Proceedings of the Workshop on Mathematically Structured Functional Programming, 2006

2005
Proof Methods for Corecursive Programs.
Fundam. Informaticae, 2005

Accurate Step Counting.
Proceedings of the Implementation and Application of Functional Languages, 2005

2004
Calculating an exceptional machine.
Proceedings of the Revised Selected Papers from the Fifth Symposium on Trends in Functional Programming, 2004

Compiling Exceptions Correctly.
Proceedings of the Mathematics of Program Construction, 7th International Conference, 2004

2002
The countdown problem.
J. Funct. Program., 2002

2001
The generic approximation lemma.
Inf. Process. Lett., 2001

When is a function a fold or an unfold?
Proceedings of the Coalgebraic Methods in Computer Science, 2001

2000
Preface.
Proceedings of the 2000 ACM SIGPLAN Workshop on Haskell, 2000

1999
A Tutorial on the Universality and Expressiveness of Fold.
J. Funct. Program., 1999

1998
Monadic Parsing in Haskell.
J. Funct. Program., 1998

Fold and Unfold for Program Semantics.
Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP '98), 1998

1997
A Strategy for On-line Interpretation of Sketched Engineering Drawings.
Proceedings of the 4th International Conference Document Analysis and Recognition (ICDAR '97), 1997

1996
Back to Basics: Deriving Representation Changers Functionally.
J. Funct. Program., 1996

1995
Bananas in Space: Extending Fold and Unfold to Exponential Types.
Proceedings of the seventh international conference on Functional programming languages and computer architecture, 1995

1994
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., 1994

Categories, Allegories and Circuit Design
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

1992
Between functions and relations in calculating programs.
PhD thesis, 1992

Higher-Order Functions for Parsing.
J. Funct. Program., 1992

1991
Making Functionality More General.
Proceedings of the Functional Programming, 1991

1990
Functional Programming with Relations.
Proceedings of the 1990 Glasgow Workshop on Functional Programming, 1990

1989
Parsing Using Combinators.
Proceedings of the Functional Programming, 1989


  Loading...