Skip to search formSkip to main contentSkip to account menu
  • Publications
  • Influence
Report on the programming language Haskell: a non-strict, purely functional language version 1.2
TLDR
"Some half dozen persons have written technically on combinatory logic, and most of these, including ourselves, have published something erroneous"; this is regarded as evidence that the subject is refractory.
View on ACM
Composable memory transactions
TLDR
This paper presents a new concurrency model, based on transactional memory, that offers far richer composition, and describes new modular forms of blocking and choice that have been inaccessible in earlier work.
View on ACM
Template meta-programming for Haskell
TLDR
A new extension to the purely functional programming language Haskell that supports compile-time meta-programming and the ability to generate code at compile time allows the programmer to implement such features as polytypic programs, macro-like expansion, user directed optimization, and the generation of supporting data structures and functions from existing data structure and functions.
View on ACM
A short cut to deforestation
TLDR
This work proposes an automatic technique for improving theiency of programs, by removing many of these intermediate lists, based on a single, simple, local transformation.
View on ACM
The Implementation of Functional Programming Languages
View via Publisher
Concurrent Haskell
TLDR
This work has developed a freely-available implementation of Concurrent Haskell, and is now using it as a substrate for a graphical user interface toolkit.
View on ACM
Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
  • S. Jones
  • Computer Science
    Journal of Functional Programming
  • 1 April 1992
TLDR
The Spineless Tagless G-machine is an abstract machine designed to support non-strict higher-order functional languages, and the STG language is an austere but recognizably-functional language, which as a denotational meaning has a well-defined operational semantics.
View on Cambridge Press
A history of Haskell: being lazy with class
This paper describes the history of Haskell, including its genesis and principles, technical contributions, implementations and tools, and applications and impact.
View on ACM
Scrap your boilerplate: a practical design pattern for generic programming
TLDR
This work describes a design pattern for writing programs that traverse data structures built from rich mutually-recursive data types that makes essential use of rank-2 polymorphism, an extension found in some implementations of Haskell.
View on ACM
System F with type equality coercions
We introduce System FC, which extends System F with support for non-syntactic type equality. There are two main extensions: (i) explicit witnesses for type equalities, and (ii) open, non-parametric…
View on ACM
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License