 | 2010 |
|---|
| 154 |       | Dimitrios Vytiniotis,
Simon L. Peyton Jones,
Tom Schrijvers:
Let should not be generalized.
TLDI 2010: 39-50 |
| 2009 |
|---|
| 153 | | Simon L. Peyton Jones:
Classes, Jim, But Not as We Know Them - Type Classes in Haskell: What, Why, and Whither.
ECOOP 2009: 1 |
| 152 | | Maximilian C. Bolingbroke,
Simon L. Peyton Jones:
Types are calling conventions.
Haskell 2009: 1-12 |
| 151 | | Tom Schrijvers,
Simon L. Peyton Jones,
Martin Sulzmann,
Dimitrios Vytiniotis:
Complete and decidable type inference for GADTs.
ICFP 2009: 341-352 |
| 150 | | Simon Marlow,
Simon L. Peyton Jones,
Satnam Singh:
Runtime support for multicore Haskell.
ICFP 2009: 65-78 |
| 149 | | Dana N. Xu,
Simon L. Peyton Jones,
Koen Claessen:
Static contract checking for Haskell.
POPL 2009: 41-52 |
| 2008 |
|---|
| 148 | | Simon L. Peyton Jones:
Harnessing the Multicores: Nested Data Parallelism in Haskell.
APLAS 2008: 138 |
| 147 | | Simon L. Peyton Jones,
Satnam Singh:
A Tutorial on Parallel and Concurrent Programming in Haskell.
Advanced Functional Programming 2008: 267-305 |
| 146 | | Simon L. Peyton Jones,
Roman Leshchinskiy,
Gabriele Keller,
Manuel M. T. Chakravarty:
Harnessing the Multicores: Nested Data Parallelism in Haskell.
FSTTCS 2008: 383-414 |
| 145 | | Dimitrios Vytiniotis,
Stephanie Weirich,
Simon L. Peyton Jones:
FPH: first-class polymorphism for Haskell.
ICFP 2008: 295-306 |
| 144 | | Tom Schrijvers,
Simon L. Peyton Jones,
Manuel M. T. Chakravarty,
Martin Sulzmann:
Type checking with open type functions.
ICFP 2008: 51-62 |
| 143 | | Simon Marlow,
Tim Harris,
Roshan P. James,
Simon L. Peyton Jones:
Parallel generational-copying garbage collection with a block-structured heap.
ISMM 2008: 11-20 |
| 142 | | Barry Jay,
Simon L. Peyton Jones:
Scrap Your Type Applications.
MPC 2008: 2-27 |
| 141 | | Tim Harris,
Simon Marlow,
Simon L. Peyton Jones,
Maurice Herlihy:
Composable memory transactions.
Commun. ACM 51(8): 91-100 (2008) |
| 2007 |
|---|
| 140 | | Manuel M. T. Chakravarty,
Roman Leshchinskiy,
Simon L. Peyton Jones,
Gabriele Keller,
Simon Marlow:
Data parallel Haskell: a status report.
DAMP 2007: 10-18 |
| 139 | | Paul Hudak,
John Hughes,
Simon L. Peyton Jones,
Philip Wadler:
A history of Haskell: being lazy with class.
HOPL 2007: 1-55 |
| 138 | | Peng Li,
Simon Marlow,
Simon L. Peyton Jones,
Andrew P. Tolmach:
Lightweight concurrency primitives for GHC.
Haskell 2007: 107-118 |
| 137 | | Simon L. Peyton Jones,
Philip Wadler:
Comprehensive comprehensions.
Haskell 2007: 61-72 |
| 136 | | Simon Marlow,
Alexey Rodriguez Yakushev,
Simon L. Peyton Jones:
Faster laziness using dynamic pointer tagging.
ICFP 2007: 277-288 |
| 135 | | Simon L. Peyton Jones:
Call-pattern specialisation for haskell programs.
ICFP 2007: 327-337 |
| 134 | | Martin Sulzmann,
Manuel M. T. Chakravarty,
Simon L. Peyton Jones,
Kevin Donnelly:
System F with type equality coercions.
TLDI 2007: 53-66 |
| 133 | | Simon L. Peyton Jones,
Dimitrios Vytiniotis,
Stephanie Weirich,
Mark Shields:
Practical type inference for arbitrary-rank types.
J. Funct. Program. 17(1): 1-82 (2007) |
| 132 | | Martin Sulzmann,
Gregory J. Duck,
Simon L. Peyton Jones,
Peter J. Stuckey:
Understanding functional dependencies via constraint handling rules.
J. Funct. Program. 17(1): 83-129 (2007) |
| 131 | | R. Kent Dybvig,
Simon L. Peyton Jones,
A. M. R. Sabry:
A monadic framework for delimited continuations.
J. Funct. Program. 17(6): 687-730 (2007) |
| 2006 |
|---|
| 130 |  | J. Gregory Morrisett,
Simon L. Peyton Jones:
Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2006, Charleston, South Carolina, USA, January 11-13, 2006
ACM 2006 |
| 129 | | Ben Rudiak-Gould,
Alan Mycroft,
Simon L. Peyton Jones:
Haskell Is Not Not ML.
ESOP 2006: 38-53 |
| 128 | | Anthony Discolo,
Tim Harris,
Simon Marlow,
Simon L. Peyton Jones,
Satnam Singh:
Lock Free Data Structures Using STM in Haskell.
FLOPS 2006: 65-80 |
| 127 | | Gary T. Leavens,
Jean-Raymond Abrial,
Don S. Batory,
Michael J. Butler,
Alessandro Coglio,
Kathi Fisler,
Eric C. R. Hehner,
Cliff B. Jones,
Dale Miller,
Simon L. Peyton Jones,
Murali Sitaraman,
Douglas R. Smith,
Aaron Stump:
Roadmap for enhanced languages and methods to aid verification.
GPCE 2006: 221-236 |
| 126 | | Dimitrios Vytiniotis,
Stephanie Weirich,
Simon L. Peyton Jones:
Boxy types: inference for higher-rank types and impredicativity.
ICFP 2006: 251-262 |
| 125 | | Simon L. Peyton Jones,
Dimitrios Vytiniotis,
Stephanie Weirich,
Geoffrey Washburn:
Simple unification-based type inference for GADTs.
ICFP 2006: 50-61 |
| 124 | | Simon Marlow,
Simon L. Peyton Jones:
Making a fast curry: push/enter vs. eval/apply for higher-order languages.
J. Funct. Program. 16(4-5): 415-449 (2006) |
| 2005 |
|---|
| 123 | | Tim Harris,
Simon Marlow,
Simon L. Peyton Jones:
Haskell on a shared-memory multiprocessor.
Haskell 2005: 49-61 |
| 122 | | Ralf Lämmel,
Simon L. Peyton Jones:
Scrap your boilerplate with class: extensible generic functions.
ICFP 2005: 204-215 |
| 121 | | Manuel M. T. Chakravarty,
Gabriele Keller,
Simon L. Peyton Jones:
Associated type synonyms.
ICFP 2005: 241-253 |
| 120 | | Manuel M. T. Chakravarty,
Gabriele Keller,
Simon L. Peyton Jones,
Simon Marlow:
Associated types with class.
POPL 2005: 1-13 |
| 119 | | Tim Harris,
Simon Marlow,
Simon L. Peyton Jones,
Maurice Herlihy:
Composable memory transactions.
PPOPP 2005: 48-60 |
| 2004 |
|---|
| 118 | | Gregory J. Duck,
Simon L. Peyton Jones,
Peter J. Stuckey,
Martin Sulzmann:
Sound and Decidable Type Inference for Functional Dependencies.
ESOP 2004: 49-63 |
| 117 | | Norman Ramsey,
Simon L. Peyton Jones:
The C - compiler infrastructure.
ICFP 2004: 1 |
| 116 | | Ralf Lämmel,
Simon L. Peyton Jones:
Scrap more boilerplate: reflection, zips, and generalised casts.
ICFP 2004: 244-255 |
| 115 | | Simon Marlow,
Simon L. Peyton Jones:
Making a fast curry: push/enter vs. eval/apply for higher-order languages.
ICFP 2004: 4-15 |
| 114 | | Andrew M. Cheadle,
A. J. Field,
Simon Marlow,
Simon L. Peyton Jones,
R. Lyndon While:
Exploring the barrier to entry: incremental generational garbage collection for Haskell.
ISMM 2004: 163-174 |
| 113 | | Alan F. Blackwell,
Margaret M. Burnett,
Simon L. Peyton Jones:
Champagne Prototyping: A Research Technique for Early Evaluation of Complex End-User Programming Systems.
VL/HCC 2004: 47-54 |
| 112 | | Clement A. Baker-Finch,
Kevin Glynn,
Simon L. Peyton Jones:
Constructed product result analysis for Haskell.
J. Funct. Program. 14(2): 211-245 (2004) |
| 2003 |
|---|
| 111 | | Johan Jeuring,
Simon L. Peyton Jones:
Advanced Functional Programming, 4th International School, AFP 2002, Oxford, UK, August 19-24, 2002, Revised Lectures
Springer 2003 |
| 110 | | Simon L. Peyton Jones,
Ralf Lämmel:
Scrap Your Boilerplate.
APLAS 2003: 357 |
| 109 | | Simon L. Peyton Jones,
Alan F. Blackwell,
Margaret M. Burnett:
A user-centred approach to functions in Excel.
ICFP 2003: 165-176 |
| 108 | | Robert Ennals,
Simon L. Peyton Jones:
Optimistic evaluation: an adaptive evaluation strategy for non-strict programs.
ICFP 2003: 287-298 |
| 107 | | Ralf Lämmel,
Simon L. Peyton Jones:
Scrap your boilerplate: a practical design pattern for generic programming.
TLDI 2003: 26-37 |
| 106 | | Simon L. Peyton Jones:
Haskell 98: Introduction.
J. Funct. Program. 13(1): 0-6 (2003) |
| 105 | | Simon L. Peyton Jones:
Haskell 98: Standard Prelude.
J. Funct. Program. 13(1): 103-124 (2003) |
| 104 | | Simon L. Peyton Jones:
Haskell 98: Syntax Reference.
J. Funct. Program. 13(1): 125-138 (2003) |
| 103 | | Simon L. Peyton Jones:
Haskell 98: Specification of Derived Instances.
J. Funct. Program. 13(1): 139-144 (2003) |
| 102 | | Simon L. Peyton Jones:
Haskell 98: Compiler Pragmas.
J. Funct. Program. 13(1): 145-146 (2003) |
| 101 | | Simon L. Peyton Jones:
Haskell 98 Libraries: Rational Numbers.
J. Funct. Program. 13(1): 149-152 (2003) |
| 100 | | Simon L. Peyton Jones:
Haskell 98 Libraries: Complex Numbers.
J. Funct. Program. 13(1): 153-156 (2003) |
| 99 | | Simon L. Peyton Jones:
Haskell 98 Libraries: Numeric Functions.
J. Funct. Program. 13(1): 157-168 (2003) |
| 98 | | Simon L. Peyton Jones:
Haskell 98 Libraries: Indexing Operations.
J. Funct. Program. 13(1): 169-172 (2003) |
| 97 | | Simon L. Peyton Jones:
Haskell 98: Expressions.
J. Funct. Program. 13(1): 17-38 (2003) |
| 96 | | Simon L. Peyton Jones:
Haskell 98 Libraries: Arrays.
J. Funct. Program. 13(1): 173-178 (2003) |
| 95 | | Simon L. Peyton Jones:
Haskell 98 Libraries: List Utilities.
J. Funct. Program. 13(1): 179-190 (2003) |
| 94 | | Simon L. Peyton Jones:
Haskell 98 Libraries: Maybe Utilities.
J. Funct. Program. 13(1): 191-192 (2003) |
| 93 | | Simon L. Peyton Jones:
Haskell 98 Libraries: Character Utilities.
J. Funct. Program. 13(1): 193-198 (2003) |
| 92 | | Simon L. Peyton Jones:
Haskell 98 Libraries: Monad Utilities.
J. Funct. Program. 13(1): 199-204 (2003) |
| 91 | | Simon L. Peyton Jones:
Haskell 98 Libraries: Input/Output.
J. Funct. Program. 13(1): 205-218 (2003) |
| 90 | | Simon L. Peyton Jones:
Haskell 98 Libraries: Directory Functions.
J. Funct. Program. 13(1): 219-222 (2003) |
| 89 | | Simon L. Peyton Jones:
Haskell 98 Libraries: System Functions.
J. Funct. Program. 13(1): 223-224 (2003) |
| 88 | | Simon L. Peyton Jones:
Haskell 98 Libraries: Dates and Times.
J. Funct. Program. 13(1): 225-230 (2003) |
| 87 | | Simon L. Peyton Jones:
Haskell 98 Libraries: Locales.
J. Funct. Program. 13(1): 231-232 (2003) |
| 86 | | Simon L. Peyton Jones:
Haskell 98 Libraries: CPU Time.
J. Funct. Program. 13(1): 233-234 (2003) |
| 85 | | Simon L. Peyton Jones:
Haskell 98 Libraries: Random Numbers.
J. Funct. Program. 13(1): 235-240 (2003) |
| 84 | | Simon L. Peyton Jones:
Haskell 98 Libraries: Bibliography.
J. Funct. Program. 13(1): 241-255 (2003) |
| 83 | | Simon L. Peyton Jones:
Haskell 98: Declarations and Bindings.
J. Funct. Program. 13(1): 39-66 (2003) |
| 82 | | Simon L. Peyton Jones:
Haskell 98: Modules.
J. Funct. Program. 13(1): 67-80 (2003) |
| 81 | | Simon L. Peyton Jones:
Haskell 98: Lexical Structure.
J. Funct. Program. 13(1): 7-16 (2003) |
| 80 | | Simon L. Peyton Jones:
Haskell 98: Predefined Types and Classes.
J. Funct. Program. 13(1): 81-96 (2003) |
| 79 | | Simon L. Peyton Jones:
Haskell 98: Basic Input/Output.
J. Funct. Program. 13(1): 97-102 (2003) |
| 78 | | Simon L. Peyton Jones,
Philip Wadler:
The Educational Pearls column.
J. Funct. Program. 13(5): 833-834 (2003) |
| 77 | | Simon L. Peyton Jones,
Alan Blackwell,
Margaret M. Burnett:
A user-centred approach to functions in Excel.
SIGPLAN Notices 38(9): 165-176 (2003) |
| 76 | | Robert Ennals,
Simon L. Peyton Jones:
Optimistic evaluation: an adaptive evaluation strategy for non-strict programs.
SIGPLAN Notices 38(9): 287-298 (2003) |
| 2002 |
|---|
| 75 | | Simon L. Peyton Jones,
Simon Marlow:
Secrets of the Glasgow Haskell Compiler inliner.
J. Funct. Program. 12(4&5): 393-433 (2002) |
| 74 | | Tim Sheard,
Simon L. Peyton Jones:
Template meta-programming for Haskell.
SIGPLAN Notices 37(12): 60-75 (2002) |
| 2001 |
|---|
| 73 | | Simon L. Peyton Jones:
Composing Contracts: An Adventure in Financial Engineering.
FME 2001: 435 |
| 72 | | Simon Marlow,
Simon L. Peyton Jones,
Andrew Moran,
John H. Reppy:
Asynchronous Exceptions in Haskell.
PLDI 2001: 274-285 |
| 71 | | Mark Shields,
Simon L. Peyton Jones:
Object-Oriented Style Overloading for Haskell.
Electr. Notes Theor. Comput. Sci. 59(1): (2001) |
| 2000 |
|---|
| 70 | | Philip W. Trinder,
Hans-Wolfgang Loidl,
Ed. Barry Jr.,
Kei Davis,
Kevin Hammond,
Ulrike Klusik,
Simon L. Peyton Jones,
Álvaro J. Rebón Portillo:
The Multi-architecture Performance of the Parallel Functional Language GP H (Research Note).
Euro-Par 2000: 739-743 |
| 69 | | Andrew M. Cheadle,
A. J. Field,
Simon Marlow,
Simon L. Peyton Jones,
R. Lyndon While:
Non-stop Haskell.
ICFP 2000: 257-267 |
| 68 | | Simon L. Peyton Jones,
Jean-Marc Eber,
Julian Seward:
Composing contracts: an adventure in financial engineering, functional pearl.
ICFP 2000: 280-292 |
| 67 | | Peter Achten,
Simon L. Peyton Jones:
Porting the Clean Object I/O Library to Haskell.
IFL 2000: 194-213 |
| 66 | | Norman Ramsey,
Simon L. Peyton Jones:
A single intermediate language that supports multiple implementations of exceptions.
PLDI 2000: 285-298 |
| 65 | | Ralf Hinze,
Simon L. Peyton Jones:
Derivable Type Classes.
Electr. Notes Theor. Comput. Sci. 41(1): (2000) |
| 64 | | Martin Erwig,
Simon L. Peyton Jones:
Pattern Guards and Transformational Patterns.
Electr. Notes Theor. Comput. Sci. 41(1): (2000) |
| 1999 |
|---|
| 63 | | Oege de Moor,
Simon L. Peyton Jones,
Eric Van Wyk:
Aspect-Oriented Compilers.
GCSE 1999: 121-133 |
| 62 | | Sigbjorn Finne,
Daan Leijen,
Erik Meijer,
Simon L. Peyton Jones:
Calling Hell From Heaven and Heaven From Hell.
ICFP 1999: 114-125 |
| 61 | | Simon L. Peyton Jones,
Simon Marlow,
Conal Elliott:
Stretching the Storage Manager: Weak Pointers and Stable Names in Haskell.
IFL 1999: 37-58 |
| 60 | | Simon L. Peyton Jones,
Alastair Reid,
Fergus Henderson,
C. A. R. Hoare,
Simon Marlow:
A Semantics for Imprecise Exceptions.
PLDI 1999: 25-36 |
| 59 | | Keith Wansbrough,
Simon L. Peyton Jones:
Once Upon a Polymorphic Type.
POPL 1999: 15-28 |
| 58 | | Simon L. Peyton Jones,
Norman Ramsey,
Fermin Reig:
C--: A Portable Assembly Language that Supports Garbage Collection.
PPDP 1999: 1-28 |
| 57 | | Hans-Wolfgang Loidl,
Philip W. Trinder,
Kevin Hammond,
Sahalu B. Junaidu,
Richard G. Morgan,
Simon L. Peyton Jones:
Engineering parallel symbolic programs in GPH.
Concurrency - Practice and Experience 11(12): 701-752 (1999) |
| 56 | | Andrew Moran,
Søren B. Lassen,
Simon L. Peyton Jones:
Imprecise Exceptions, Co-Inductively.
Electr. Notes Theor. Comput. Sci. 26: (1999) |
| 1998 |
|---|
| 55 | | Sigbjorn Finne,
Daan Leijen,
Erik Meijer,
Simon L. Peyton Jones:
H/Direct: A Binary Foreign Language Interface for Haskell.
ICFP 1998: 153-162 |
| 54 | | Mark Shields,
Tim Sheard,
Simon L. Peyton Jones:
Dynamic Typing as Staged Type Inference.
POPL 1998: 289-302 |
| 53 | | Simon L. Peyton Jones,
Mark Shields,
John Launchbury,
Andrew P. Tolmach:
Bridging the Gulf: A Common Intermediate Language for ML and Haskell.
POPL 1998: 49-61 |
| 52 | | Philip W. Trinder,
Kevin Hammond,
Hans-Wolfgang Loidl,
Simon L. Peyton Jones:
Algorithms + Strategy = Parallelism.
J. Funct. Program. 8(1): 23-60 (1998) |
| 51 | | Simon L. Peyton Jones,
André L. M. Santos:
A Transformation-Based Optimiser for Haskell.
Sci. Comput. Program. 32(1-3): 3-47 (1998) |
| 1997 |
|---|
| 50 | | Simon L. Peyton Jones,
Thomas Nordin,
Dino Oliva:
C-: A Portable Assembly Language.
Implementation of Functional Languages 1997: 1-19 |
| 49 | | Hans-Wolfgang Loidl,
Richard G. Morgan,
Philip W. Trinder,
Sanjay Poria,
Chris Cooper,
Simon L. Peyton Jones,
Roberto Garigliano:
Parallelising a Large Functional Program or: Keeping LOLITA Busy.
Implementation of Functional Languages 1997: 198-213 |
| 48 | | Patrick M. Sansom,
Simon L. Peyton Jones:
Formally Based Profiling for Higher-Order Functional Languages.
ACM Trans. Program. Lang. Syst. 19(2): 334-385 (1997) |
| 1996 |
|---|
| 47 | | Sigbjorn Finne,
Simon L. Peyton Jones:
Composing the User Interface with Haggis.
Advanced Functional Programming 1996: 1-37 |
| 46 | | Simon L. Peyton Jones:
Compiling Haskell by Program Transformation: A Report from the Trenches.
ESOP 1996: 18-44 |
| 45 | | Simon L. Peyton Jones,
Will Partain,
André Santos:
Let-floating: Moving Bindings to Give Faster Programs.
ICFP 1996: 1-12 |
| 44 | | Philip W. Trinder,
Kevin Hammond,
James S. Mattson Jr.,
A. S. Partridge,
Simon L. Peyton Jones:
GUM: A Portable Parallel Implementation of Haskell.
PLDI 1996: 79-88 |
| 43 | | Simon L. Peyton Jones,
Andrew Gordon,
Sigbjorn Finne:
Concurrent Haskell.
POPL 1996: 295-308 |
| 42 | | Cordelia V. Hall,
Kevin Hammond,
Simon L. Peyton Jones,
Philip Wadler:
Type Classes in Haskell.
ACM Trans. Program. Lang. Syst. 18(2): 109-138 (1996) |
| 1995 |
|---|
| 41 | | Sigbjorn Finne,
Simon L. Peyton Jones:
Composing Haggis.
Eurographics Workshop on Programming Paradigms in Graphics 1995: 85-101 |
| 40 | |
