We stand with Ukraine

We stand with Ukraine

Graham Hutton

Orcid: 0000-0001-9584-5150

Affiliations:

University of Nottingham, UK

According to our database¹, Graham Hutton authored at least 59 papers between 1989 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ 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.

[BibT_eX]

[DOI]

,

Proc. ACM Program. Lang., January, 2024

Beyond Trees: Calculating Graph-Based Compilers (Functional Pearl).

[BibT_eX]

[DOI]

,

Proc. ACM Program. Lang., 2024

Calculating Compilers Effectively (Functional Pearl).

[BibT_eX]

[DOI]

,

,

Proceedings of the 17th ACM SIGPLAN International Haskell Symposium, 2024

2023

Calculating Compilers for Concurrency.

[BibT_eX]

[DOI]

,

Proc. ACM Program. Lang., August, 2023

Programming language semantics: It's easy as 1,2,3.

[BibT_eX]

[DOI]

J. Funct. Program., 2023

2022

Monadic compiler calculation (functional pearl).

[BibT_eX]

[DOI]

,

Proc. ACM Program. Lang., 2022

Subtyping Without Reduction.

[BibT_eX]

[DOI]

,

Proceedings of the Mathematics of Program Construction - 14th International Conference, 2022

2021

Calculating dependently-typed compilers (functional pearl).

[BibT_eX]

[DOI]

Mitchell Pickard

,

Proc. ACM Program. Lang., 2021

2020

Liquidate your assets: reasoning about resource usage in liquid Haskell.

[BibT_eX]

[DOI]

Martin A. T. Handley

,

,

Proc. ACM Program. Lang., 2020

Calculating correct compilers II: Return of the register machines.

[BibT_eX]

[DOI]

,

J. Funct. Program., 2020

2019

Call-by-need is clairvoyant call-by-value.

[BibT_eX]

[DOI]

Jennifer Hackett

,

Proc. ACM Program. Lang., 2019

2018

Parametric polymorphism and operational improvement.

[BibT_eX]

[DOI]

Jennifer Hackett

,

Proc. ACM Program. Lang., 2018

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

[BibT_eX]

[DOI]

,

Joachim Breitner

,

,

,

CoRR, 2018

Improving Haskell.

[BibT_eX]

[DOI]

Martin A. T. Handley

,

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

Theorem proving for all: equational reasoning in liquid Haskell (functional pearl).

[BibT_eX]

[DOI]

,

Joachim Breitner

,

,

,

Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell, 2018

AutoBench: comparing the time performance of Haskell programs.

[BibT_eX]

[DOI]

Martin A. T. Handley

,

Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell, 2018

2017

Compiling a 50-year journey.

[BibT_eX]

[DOI]

,

J. Funct. Program., 2017

Failing Faster: Overlapping Patterns for Property-Based Testing.

[BibT_eX]

[DOI]

Jonathan Fowler

,

Proceedings of the Practical Aspects of Declarative Languages, 2017

2016

PhD Abstracts.

[BibT_eX]

[DOI]

J. Funct. Program., 2016

Contractive Functions on Infinite Data Structures.

[BibT_eX]

[DOI]

Venanzio Capretta

,

,

Mauro Jaskelioff

Proceedings of the 28th Symposium on the Implementation and Application of Functional Programming Languages, 2016

Cutting Out Continuations.

[BibT_eX]

[DOI]

,

Proceedings of the A List of Successes That Can Change the World, 2016

2015

Calculating correct compilers.

[BibT_eX]

[DOI]

,

J. Funct. Program., 2015

Towards a Theory of Reach.

[BibT_eX]

[DOI]

Jonathan Fowler

,

Proceedings of the Trends in Functional Programming - 16th International Symposium, 2015

Programs for Cheap!

[BibT_eX]

[DOI]

Jennifer Hackett

,

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

2014

Practices of PLDI.

[BibT_eX]

[DOI]

Hans-Juergen Boehm

,

Jack W. Davidson

,

Kathleen Fisher

,

Cormac Flanagan

,

,

,

,

,

,

,

ACM SIGPLAN Notices, 2014

Work it, wrap it, fix it, fold it.

[BibT_eX]

[DOI]

Neil Sculthorpe

,

J. Funct. Program., 2014

Worker/wrapper/makes it/faster.

[BibT_eX]

[DOI]

Jennifer Hackett

,

Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 2014

2013

The Under-Performing Unfold: A new approach to optimising corecursive programs.

[BibT_eX]

[DOI]

Jennifer Hackett

,

,

Mauro Jaskelioff

Proceedings of the 25th Symposium on Implementation and Application of Functional Languages, 2013

Compilation à la Carte.

[BibT_eX]

[DOI]

Laurence E. Day

,

Proceedings of the 25th Symposium on Implementation and Application of Functional Languages, 2013

2012

SIGPLAN vice-chair's report.

[BibT_eX]

[DOI]

ACM SIGPLAN Notices, 2012

2011

Towards Modular Compilers for Effects.

[BibT_eX]

[DOI]

Laurence E. Day

,

Proceedings of the Trends in Functional Programming, 12th International Symposium, 2011

2010

Factorising folds for faster functions.

[BibT_eX]

[DOI]

,

Mauro Jaskelioff

,

J. Funct. Program., 2010

2009

The worker/wrapper transformation.

[BibT_eX]

[DOI]

,

J. Funct. Program., 2009

Compiling Concurrency Correctly: Cutting out the Middle Man.

[BibT_eX]

,

Proceedings of the Tenth Symposium on Trends in Functional Programming, 2009

2008

Modularity and Implementation of Mathematical Operational Semantics.

[BibT_eX]

[DOI]

Mauro Jaskelioff

,

,

Proceedings of the Second Workshop on Mathematically Structured Functional Programming, 2008

Towards a Verified STM.

[BibT_eX]

,

Proceedings of the Nineth Symposium on Trends in Functional Programming, 2008

2007

What is the meaning of these constant interruptions?

[BibT_eX]

[DOI]

,

J. Funct. Program., 2007

2006

Compact Fusion.

[BibT_eX]

[DOI]

,

Proceedings of the Workshop on Mathematically Structured Functional Programming, 2006

2005

Proof Methods for Corecursive Programs.

[BibT_eX]

[DOI]

,

Fundam. Informaticae, 2005

Accurate Step Counting.

[BibT_eX]

[DOI]

,

Proceedings of the Implementation and Application of Functional Languages, 2005

2004

Calculating an exceptional machine.

[BibT_eX]

,

Proceedings of the Revised Selected Papers from the Fifth Symposium on Trends in Functional Programming, 2004

Compiling Exceptions Correctly.

[BibT_eX]

[DOI]

,

Proceedings of the Mathematics of Program Construction, 7th International Conference, 2004

2002

The countdown problem.

[BibT_eX]

[DOI]

J. Funct. Program., 2002

2001

The generic approximation lemma.

[BibT_eX]

[DOI]

,

Inf. Process. Lett., 2001

When is a function a fold or an unfold?

[BibT_eX]

[DOI]

,

,

Thorsten Altenkirch

Proceedings of the Coalgebraic Methods in Computer Science, 2001

2000

Preface.

[BibT_eX]

[DOI]

Proceedings of the 2000 ACM SIGPLAN Workshop on Haskell, 2000

1999

A Tutorial on the Universality and Expressiveness of Fold.

[BibT_eX]

[DOI]

J. Funct. Program., 1999

1998

Monadic Parsing in Haskell.

[BibT_eX]

[DOI]

,

J. Funct. Program., 1998

Fold and Unfold for Program Semantics.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the 4th International Conference Document Analysis and Recognition (ICDAR '97), 1997

1996

Back to Basics: Deriving Representation Changers Functionally.

[BibT_eX]

,

J. Funct. Program., 1996

1995

Bananas in Space: Extending Fold and Unfold to Exponential Types.

[BibT_eX]

[DOI]

,

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.

[BibT_eX]

[DOI]

J. Funct. Program., 1994

Categories, Allegories and Circuit Design

[BibT_eX]

[DOI]

,

Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

1992

Between functions and relations in calculating programs.

[BibT_eX]

[DOI]

PhD thesis, 1992

Higher-Order Functions for Parsing.

[BibT_eX]

[DOI]

J. Funct. Program., 1992

1991

Making Functionality More General.

[BibT_eX]

[DOI]

,

Proceedings of the Functional Programming, 1991

1990

Functional Programming with Relations.

[BibT_eX]

[DOI]

Proceedings of the 1990 Glasgow Workshop on Functional Programming, 1990

1989

Parsing Using Combinators.

[BibT_eX]

Proceedings of the Functional Programming, 1989

Loading...