Simon Peyton-jones

Under consideration for publication in J. Functional Programming 1 Understanding Functional Dependencies via Constraint Handling Rules (2008)

Martin Sulzmann, Gregory J. Duck, Simon Peyton-jones, Peter J. Stuckey

Functional dependencies are a popular and useful extension to Haskell style type classes. We give a reformulation of functional dependencies in terms of Constraint Handling Rules (CHRs). In previous...

Under consideration for publication in J. Functional Programming 1 Understanding Functional Dependencies via Constraint Handling Rules (2008)

Martin Sulzmann, Gregory J. Duck, Simon Peyton-jones, Peter J. Stuckey

Functional dependencies are a popular and useful extension to Haskell style type classes. We give a reformulation of functional dependencies in terms of Constraint Handling Rules (CHRs). In previous...

Towards Open Type Functions for Haskell — DRAFT — (2008)

Tom Schrijvers, Martin Sulzmann, Simon Peyton-jones

Abstract. We report on an extension of Haskell with type(-level) functions and equality constraints. We illustrate their usefulness in the context of phantom types, GADTs and type classes. Problems...

Under consideration for publication in J. Functional Programming 1 Understanding Functional Dependencies via Constraint Handling Rules (2008)

Martin Sulzmann, Gregory J. Duck, Simon Peyton-jones, Peter J. Stuckey, Martin Sulzmann, Gregory J. Duck, ...

Functional dependencies are a popular and useful extension to Haskell style type classes. We give a reformulation of functional dependencies in terms of Constraint Handling Rules (CHRs). In previous...

Towards Open Type Functions for Haskell (2008)

Tom Schrijvers, Martin Sulzmann, Simon Peyton-jones

Abstract. We report on an extension of Haskell with type(-level) functions and equality constraints. We illustrate their usefulness in the context of phantom types, GADTs and type classes. Problems...

1 (2007)

Gregory J. Duck, Simon Peyton-jones, Peter J. Stuckey

Abstract. Functional dependencies are a popular and useful extension to Haskell style type classes. In this paper, we give a reformulation of functional dependencies in terms of Constraint Handling...

Robert Ennals (2007)

Feris Functional Environment, Name Robert Ennals, Retargetable Interactive Systems, Retargetable Interactive Systems, Simon Peyton-jones

Model = Figure 2.3.5: One App can be run on the Web, or as a GUI Low level targets, and translators should be implemented so as to allow programs to run as both GUI apps, and Web pages.

Haskell Communities and Activities Report (2007)

Andres Löh (ed, Lloyd Allison, Tiago Miguel, Laureano Alves, Krasimir Angelov, Carlos Areces, ...

You are reading the twelfth edition of the Haskell Communities and Activities Report – as always, containing entries from enthusiastic Haskellers all over the world. This edition has 138 entries,...

Preface (2006)

A. Stump, H. Xi, Thorsten Altenkirch, Hugo Herbelin, Simon Peyton-jones, Y Pollack, ...

The main goal of PLPV is to bring together researchers exploring language-based approaches to program verification. Typically in these approaches, the programming language provides mechanisms which...

Haskell Communities and Activities Report (2006)

Andres Löh (ed, Lloyd Allison, Tiago Miguel, Laureano Alves, Krasimir Angelov, Dmitry Astapov, ...

Welcome to the eleventh edition of the Haskell Communities and Activities Report – a collection of entries about everything that is going on and related to Haskell in some way that appears twice a...

Haskell Communities and Activities Report (2006)

Andres Löh (ed, Lloyd Allison, Tiago Miguel, Laureano Alves, Krasimir Angelov, Dmitry Astapov, ...

This is the tenth edition of the Haskell Communities and Activities Report (HCAR) – a collection of entries about everything that is going on and related to Haskell in some way that appears twice a...

Contents (2006)

Dimitrios Vytiniotis, Stephanie Weirich, Simon Peyton-jones

Boxy type inference for higher-rank types and

Practical type inference for arbitrary-rank types (2005)

Dimitrios Vytiniotis, Stephanie Weirich, Simon Peyton-jones

Note: This document accompanies the paper “Practical type inference for arbitrary-rank types ” [6]. Prior reading of the main paper is required. 1 Contents

Haskell Communities and Activities Report (2005)

Andres Löh (ed, Lloyd Allison, Tiago Miguel, Laureano Alves, Krasimir Angelov, Alistair Bayley, ...

Finally, here is the 9th edition of the Haskell Communities and Activities Report (HCAR), almost three weeks after the submission deadline. This delay is entirely my own fault. In fact, I have to...

Haskell Communities and Activities Report (2005)

Andres Löh (ed, Perry Alexander, Lloyd Allison, Tiago Miguel, Laureano Alves, Krasimir Angelov, ...

You are reading the 8th edition of the Haskell Communities and Activities Report (HCAR). These are interesting times to be a Haskell enthusiast. Everyone seems to be talking about darcs ( → 6.3)...

Haskell Communities and Activities Report (2004)

Andres Löh (ed, Perry Alexander, Lloyd Allison, Krasimir Angelov, Alistair Bayley, Jérémy Bobbio, ...

Welcome to the Seventh edition of the Haskell Communities and Activities report. I can proudly announce that the report has survived yet another change of editor, and chances are good that this...

Sound and decidable type inference for functional dependencies (2004)

Gregory J. Duck, Simon Peyton-jones, Peter J. Stuckey

Abstract. Functional dependencies are a popular and useful extension to Haskell style type classes. In this paper, we give a reformulation of functional dependencies in terms of Constraint Handling...

Aspect-Oriented Compilers (1999)

Oege De Moor, Simon Peyton-Jones, Eric Van Wyk

Aspect-oriented programming provides the programmer with means to cross-cut conventional program structures, in particular the class hierarchies of object-oriented programming. This paper studies the...

Aspect-Oriented Compilers (1999)

Oege De Moor, Simon Peyton-jones

Lazy evaluation allows compiler writers to ignore a separation into passes, and to focus on the logical structure of their compiler instead. This is also a feature of attribute grammars, which can be...