
Simon L. Peyton Jones
Simon Peyton Jones
Person information
- affiliation: Microsoft Research
- award (2016): Programming Languages Achievement Award
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
- [j78]Andrey Mokhov
, Neil Mitchell, Simon Peyton Jones:
Build systems à la carte: Theory and practice. J. Funct. Program. 30: e11 (2020) - [j77]Matt McCutchen
, Judith Borghouts, Andrew D. Gordon
, Simon Peyton Jones, Advait Sarkar:
Elastic sheet-defined functions: Generalising spreadsheet functions to variable-size input arrays. J. Funct. Program. 30: e26 (2020) - [j76]Alejandro Serrano, Jurriaan Hage, Simon Peyton Jones, Dimitrios Vytiniotis:
A quick look at impredicativity. Proc. ACM Program. Lang. 4(ICFP): 89:1-89:29 (2020) - [j75]Paul Downen, Zena M. Ariola, Simon Peyton Jones, Richard A. Eisenberg:
Kinds are calling conventions. Proc. ACM Program. Lang. 4(ICFP): 104:1-104:29 (2020) - [j74]Sebastian Graf, Simon Peyton Jones, Ryan G. Scott:
Lower your guards: a compositional pattern-match coverage checker. Proc. ACM Program. Lang. 4(ICFP): 107:1-107:30 (2020) - [i8]Zichao Wang, Sebastian Tschiatschek, Simon Woodhead, José Miguel Hernández-Lobato, Simon Peyton Jones, Cheng Zhang:
Large-Scale Educational Question Analysis with Partial Variational Auto-encoders. CoRR abs/2003.05980 (2020) - [i7]Zichao Wang, Angus Lamb, Evgeny Saveliev, Pashmina Cameron, Yordan Zaykov, José Miguel Hernández-Lobato, Richard E. Turner, Richard G. Baraniuk, Craig Barton, Simon Peyton Jones, Simon Woodhead, Cheng Zhang:
Diagnostic Questions: The NeurIPS 2020 Education Challenge. CoRR abs/2007.12061 (2020)
2010 – 2019
- 2019
- [j73]Amir Shaikhha, Andrew W. Fitzgibbon, Dimitrios Vytiniotis, Simon Peyton Jones:
Efficient differentiable programming in a functional array-processing language. Proc. ACM Program. Lang. 3(ICFP): 97:1-97:30 (2019) - [j72]Csongor Kiss, Tony Field, Susan Eisenbach, Simon Peyton Jones:
Higher-order type-level programming in Haskell. Proc. ACM Program. Lang. 3(ICFP): 102:1-102:26 (2019) - [c145]Paul Downen, Zachary Sullivan, Zena M. Ariola, Simon Peyton Jones:
Codata in Action. ESOP 2019: 119-146 - [c144]Paul Downen, Zachary Sullivan, Zena M. Ariola, Simon Peyton Jones:
Making a faster Curry with extensional types. Haskell@ICFP 2019: 58-70 - [i6]Sebastian Graf, Simon Peyton Jones:
Selective Lambda Lifting. CoRR abs/1910.11717 (2019) - 2018
- [j71]Andrey Mokhov, Neil Mitchell, Simon Peyton Jones:
Build systems à la carte. Proc. ACM Program. Lang. 2(ICFP): 79:1-79:29 (2018) - [j70]Jean-Philippe Bernardy, Mathieu Boespflug, Ryan R. Newton, Simon Peyton Jones, Arnaud Spiwack:
Linear Haskell: practical linearity in a higher-order polymorphic language. Proc. ACM Program. Lang. 2(POPL): 5:1-5:29 (2018) - [c143]Richard A. Eisenberg, Joachim Breitner, Simon Peyton Jones:
Type variables in patterns. Haskell@ICFP 2018: 94-105 - [c142]Alejandro Serrano, Jurriaan Hage, Dimitrios Vytiniotis, Simon Peyton Jones:
Guarded impredicative polymorphism. PLDI 2018: 783-796 - [c141]Advait Sarkar, Andrew D. Gordon, Simon Peyton Jones, Neil Toronto:
Calculation View: multiple-representation editing in spreadsheets. VL/HCC 2018: 85-93 - [i5]Amir Shaikhha, Andrew W. Fitzgibbon, Dimitrios Vytiniotis, Simon Peyton Jones, Christoph Koch:
Efficient Differentiable Programming in a Functional Array-Processing Language. CoRR abs/1806.02136 (2018) - [i4]Richard A. Eisenberg, Joachim Breitner, Simon Peyton Jones:
Type variables in patterns. CoRR abs/1806.03476 (2018) - 2017
- [j69]Geoffrey Mainland, Roman Leshchinskiy, Simon Peyton Jones:
Exploiting vector instructions with generalized stream fusion. Commun. ACM 60(5): 83-91 (2017) - [j68]Ilya Sergey
, Dimitrios Vytiniotis, Simon L. Peyton Jones, Joachim Breitner:
Modular, higher order cardinality analysis in theory and practice. J. Funct. Program. 27: e11 (2017) - [j67]Shayan Najd, Simon Peyton Jones:
Trees that Grow. J. Univers. Comput. Sci. 23(1): 42-62 (2017) - [j66]Danfeng Zhang, Andrew C. Myers, Dimitrios Vytiniotis, Simon L. Peyton Jones:
SHErrLoc: A Static Holistic Error Locator. ACM Trans. Program. Lang. Syst. 39(4): 18:1-18:47 (2017) - [c140]Simon Peyton Jones:
How to Write a Great Research Paper. ICCSW 2017: 1:1-1:1 - [c139]Amir Shaikhha, Andrew W. Fitzgibbon, Simon Peyton Jones, Dimitrios Vytiniotis:
Destination-passing style for efficient memory management. FHPC@ICFP 2017: 12-23 - [c138]Luke Maurer, Paul Downen, Zena M. Ariola, Simon L. Peyton Jones:
Compiling without continuations. PLDI 2017: 482-494 - [c137]Richard A. Eisenberg, Simon Peyton Jones:
Levity polymorphism. PLDI 2017: 525-539 - [i3]Jean-Philippe Bernardy, Mathieu Boespflug, Ryan R. Newton, Simon Peyton Jones, Arnaud Spiwack:
Linear Haskell: practical linearity in a higher-order polymorphic language. CoRR abs/1710.09756 (2017) - 2016
- [j65]Joachim Breitner, Richard A. Eisenberg, Simon Peyton Jones, Stephanie Weirich
:
Safe zero-cost coercions for Haskell. J. Funct. Program. 26: e15 (2016) - [j64]K. C. Sivaramakrishnan, Tim Harris, Simon Marlow, Simon Peyton Jones:
Composable scheduler activations for Haskell. J. Funct. Program. 26: e9 (2016) - [c136]Simon Peyton Jones, Stephanie Weirich
, Richard A. Eisenberg, Dimitrios Vytiniotis:
A Reflection on Types. A List of Successes That Can Change the World 2016: 292-317 - [c135]Matthew Pickering, Gergo Érdi, Simon Peyton Jones, Richard A. Eisenberg:
Pattern synonyms. Haskell 2016: 80-91 - [c134]Simon Marlow, Simon Peyton Jones, Edward Kmett, Andrey Mokhov:
Desugaring Haskell's do-notation into applicative operations. Haskell 2016: 92-104 - [c133]Andrey Mokhov, Neil Mitchell, Simon Peyton Jones, Simon Marlow:
Non-recursive make considered harmful: build systems at scale. Haskell 2016: 170-181 - [c132]Paul Downen
, Luke Maurer, Zena M. Ariola, Simon Peyton Jones:
Sequent calculus as a compiler intermediate language. ICFP 2016: 74-88 - [i2]Shayan Najd, Simon Peyton Jones:
Trees That Grow. CoRR abs/1610.04799 (2016) - 2015
- [c131]Jan Stolarek
, Simon L. Peyton Jones, Richard A. Eisenberg:
Injective type families for Haskell. Haskell 2015: 118-128 - [c130]Georgios Karachalias, Tom Schrijvers
, Dimitrios Vytiniotis, Simon L. Peyton Jones:
GADTs meet their match: pattern-matching warnings that account for GADTs, guards, and laziness. ICFP 2015: 424-436 - [c129]Danfeng Zhang, Andrew C. Myers, Dimitrios Vytiniotis, Simon L. Peyton Jones:
Diagnosing type errors with class. PLDI 2015: 12-21 - [c128]Simon Peyton Jones:
The dream of a lifetime: an opportunity to shape how our children learn computing. PPIG 2015: 5 - 2014
- [c127]Joachim Breitner
, Richard A. Eisenberg, Simon L. Peyton Jones, Stephanie Weirich
:
Safe zero-cost coercions for Haskell. ICFP 2014: 189-202 - [c126]Niki Vazou
, Eric L. Seidel
, Ranjit Jhala, Dimitrios Vytiniotis, Simon L. Peyton Jones:
Refinement types for Haskell. ICFP 2014: 269-282 - [c125]Scott Kilpatrick, Derek Dreyer, Simon L. Peyton Jones, Simon Marlow:
Backpack: retrofitting Haskell with interfaces. POPL 2014: 19-32 - [c124]Ilya Sergey
, Dimitrios Vytiniotis, Simon L. Peyton Jones:
Modular, higher-order cardinality analysis in theory and practice. POPL 2014: 335-348 - [c123]Richard A. Eisenberg, Dimitrios Vytiniotis, Simon L. Peyton Jones, Stephanie Weirich
:
Closed type families with overlapping equations. POPL 2014: 671-684 - 2013
- [c122]Geoffrey Mainland
, Roman Leshchinskiy, Simon L. Peyton Jones:
Exploiting vector instructions with generalized stream fusio. ICFP 2013: 37-48 - [c121]Simon L. Peyton Jones:
Computer science as a school subject. ICFP 2013: 159-160 - [c120]Simon L. Peyton Jones:
The computing at school working group. ITiCSE 2013: 1 - [c119]Dimitrios Vytiniotis, Simon L. Peyton Jones, Koen Claessen, Dan Rosén:
HALO: haskell to logic through denotational semantics. POPL 2013: 431-442 - [c118]Dimitrios Vytiniotis, Simon L. Peyton Jones:
Evidence Normalization in System FC (Invited Talk). RTA 2013: 20-38 - [c117]Neil Christopher Charles Brown, Michael Kölling, Tom Crick, Simon L. Peyton Jones, Simon Humphreys, Sue Sentance
:
Bringing computer science back into schools: lessons from the UK. SIGCSE 2013: 269-274 - [c116]Simon L. Peyton Jones:
Type-Directed Compilation in the Wild: Haskell and Core. TLCA 2013: 1 - 2012
- [c115]Oleg Kiselyov, Simon L. Peyton Jones, Amr Sabry:
Lazy v. Yield: Incremental, Linear Pretty-Printing. APLAS 2012: 190-206 - [c114]Ben Lippmeier, Manuel M. T. Chakravarty, Gabriele Keller, Simon L. Peyton Jones:
Guiding parallel array fusion with indexed types. Haskell 2012: 25-36 - [c113]Gabriele Keller, Manuel M. T. Chakravarty, Roman Leshchinskiy, Ben Lippmeier, Simon L. Peyton Jones:
Vectorisation avoidance. Haskell 2012: 37-48 - [c112]David Terei, Simon Marlow, Simon L. Peyton Jones, David Mazières:
Safe haskell. Haskell 2012: 137-148 - [c111]Ben Lippmeier, Manuel M. T. Chakravarty, Gabriele Keller, Roman Leshchinskiy, Simon L. Peyton Jones:
Work efficient higher-order vectorisation. ICFP 2012: 259-270 - [c110]Dimitrios Vytiniotis, Simon L. Peyton Jones, José Pedro Magalhães:
Equality proofs and deferred type errors: a compiler pearl. ICFP 2012: 341-352 - [c109]Brent A. Yorgey, Stephanie Weirich
, Julien Cretin, Simon L. Peyton Jones, Dimitrios Vytiniotis, José Pedro Magalhães:
Giving Haskell a promotion. TLDI 2012: 53-66 - [i1]David Terei, Simon Marlow, Simon L. Peyton Jones, David Mazières:
Safe Haskell. Tiny Trans. Comput. Sci. 1 (2012) - 2011
- [j63]Dimitrios Vytiniotis, Simon L. Peyton Jones, Tom Schrijvers
, Martin Sulzmann:
OutsideIn(X) Modular type inference with local assumptions. J. Funct. Program. 21(4-5): 333-412 (2011) - [c108]Maximilian C. Bolingbroke, Simon L. Peyton Jones, Dimitrios Vytiniotis:
Termination combinators forever. Haskell 2011: 23-34 - [c107]Simon Marlow, Ryan Newton, Simon L. Peyton Jones:
A monad for deterministic parallelism. Haskell 2011: 71-82 - [c106]Jeff Epstein, Andrew P. Black
, Simon L. Peyton Jones:
Towards Haskell in the cloud. Haskell 2011: 118-129 - [c105]Simon Marlow, Simon L. Peyton Jones:
Multicore garbage collection with local heaps. ISMM 2011: 21-32 - [c104]Stephanie Weirich
, Dimitrios Vytiniotis, Simon L. Peyton Jones, Steve Zdancewic:
Generative type abstraction and type-level computation. POPL 2011: 227-240 - 2010
- [c103]Norman Ramsey
, João Dias, Simon L. Peyton Jones:
Hoopl: a modular, reusable library for dataflow analysis and transformation. Haskell 2010: 121-134 - [c102]Maximilian C. Bolingbroke, Simon L. Peyton Jones:
Supercompilation by evaluation. Haskell 2010: 135-146 - [c101]Gabriele Keller, Manuel M. T. Chakravarty, Roman Leshchinskiy, Simon L. Peyton Jones, Ben Lippmeier:
Regular, shape-polymorphic, parallel arrays in Haskell. ICFP 2010: 261-272 - [c100]Dimitrios Vytiniotis, Simon L. Peyton Jones, Tom Schrijvers
:
Let should not be generalized. TLDI 2010: 39-50 - [p1]Oleg Kiselyov, Simon Peyton Jones, Chung-chieh Shan:
Fun with Type Functions. Reflections on the Work of C. A. R. Hoare 2010: 301-331
2000 – 2009
- 2009
- [c99]Simon L. Peyton Jones:
Classes, Jim, But Not as We Know Them - Type Classes in Haskell: What, Why, and Whither. ECOOP 2009: 1 - [c98]Maximilian C. Bolingbroke, Simon L. Peyton Jones:
Types are calling conventions. Haskell 2009: 1-12 - [c97]Tristan Oliver Richard Allwood, Simon L. Peyton Jones, Susan Eisenbach:
Finding the needle: stack traces for GHC. Haskell 2009: 129-140 - [c96]Simon Marlow, Simon L. Peyton Jones, Satnam Singh:
Runtime support for multicore Haskell. ICFP 2009: 65-78 - [c95]Tom Schrijvers
, Simon L. Peyton Jones, Martin Sulzmann, Dimitrios Vytiniotis:
Complete and decidable type inference for GADTs. ICFP 2009: 341-352 - [c94]Dana N. Xu, Simon L. Peyton Jones, Koen Claessen:
Static contract checking for Haskell. POPL 2009: 41-52 - 2008
- [j62]Tim Harris, Simon Marlow, Simon L. Peyton Jones, Maurice Herlihy:
Composable memory transactions. Commun. ACM 51(8): 91-100 (2008) - [c93]Simon L. Peyton Jones, Satnam Singh:
A Tutorial on Parallel and Concurrent Programming in Haskell. Advanced Functional Programming 2008: 267-305 - [c92]Simon L. Peyton Jones:
Harnessing the Multicores: Nested Data Parallelism in Haskell. APLAS 2008: 138 - [c91]Simon L. Peyton Jones, Roman Leshchinskiy, Gabriele Keller, Manuel M. T. Chakravarty:
Harnessing the Multicores: Nested Data Parallelism in Haskell. FSTTCS 2008: 383-414 - [c90]Tom Schrijvers
, Simon L. Peyton Jones, Manuel M. T. Chakravarty, Martin Sulzmann:
Type checking with open type functions. ICFP 2008: 51-62 - [c89]Dimitrios Vytiniotis, Stephanie Weirich
, Simon L. Peyton Jones:
FPH: first-class polymorphism for Haskell. ICFP 2008: 295-306 - [c88]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 - [c87]Barry Jay, Simon L. Peyton Jones:
Scrap Your Type Applications. MPC 2008: 2-27 - 2007
- [j61]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) - [j60]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) - [j59]R. Kent Dybvig, Simon L. Peyton Jones, Amr Sabry
:
A monadic framework for delimited continuations. J. Funct. Program. 17(6): 687-730 (2007) - [c86]Simon L. Peyton Jones, Philip Wadler:
Comprehensive comprehensions. Haskell 2007: 61-72 - [c85]Peng Li, Simon Marlow, Simon L. Peyton Jones, Andrew P. Tolmach:
Lightweight concurrency primitives for GHC. Haskell 2007: 107-118 - [c84]Paul Hudak, John Hughes, Simon L. Peyton Jones, Philip Wadler:
A history of Haskell: being lazy with class. HOPL 2007: 1-55 - [c83]Simon Marlow, Alexey Rodriguez Yakushev, Simon L. Peyton Jones:
Faster laziness using dynamic pointer tagging. ICFP 2007: 277-288 - [c82]Simon L. Peyton Jones:
Call-pattern specialisation for haskell programs. ICFP 2007: 327-337 - [c81]Manuel M. T. Chakravarty, Roman Leshchinskiy, Simon L. Peyton Jones, Gabriele Keller, Simon Marlow:
Data parallel Haskell: a status report. DAMP 2007: 10-18 - [c80]Martin Sulzmann, Manuel M. T. Chakravarty, Simon L. Peyton Jones, Kevin Donnelly:
System F with type equality coercions. TLDI 2007: 53-66 - 2006
- [j58]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) - [c79]Ben Rudiak-Gould, Alan Mycroft
, Simon L. Peyton Jones:
Haskell Is Not Not ML. ESOP 2006: 38-53 - [c78]Anthony Discolo, Tim Harris, Simon Marlow, Simon L. Peyton Jones, Satnam Singh:
Lock Free Data Structures Using STM in Haskell. FLOPS 2006: 65-80 - [c77]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 - [c76]Simon L. Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich
, Geoffrey Washburn:
Simple unification-based type inference for GADTs. ICFP 2006: 50-61 - [c75]Dimitrios Vytiniotis, Stephanie Weirich
, Simon L. Peyton Jones:
Boxy types: inference for higher-rank types and impredicativity. ICFP 2006: 251-262 - [e6]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, ISBN 1-59593-027-2 [contents] - 2005
- [c74]Tim Harris, Simon Marlow, Simon L. Peyton Jones:
Haskell on a shared-memory multiprocessor. Haskell 2005: 49-61 - [c73]Ralf Lämmel
, Simon L. Peyton Jones:
Scrap your boilerplate with class: extensible generic functions. ICFP 2005: 204-215 - [c72]Manuel M. T. Chakravarty, Gabriele Keller, Simon L. Peyton Jones:
Associated type synonyms. ICFP 2005: 241-253 - [c71]Manuel M. T. Chakravarty, Gabriele Keller, Simon L. Peyton Jones, Simon Marlow:
Associated types with class. POPL 2005: 1-13 - [c70]Tim Harris, Simon Marlow, Simon L. Peyton Jones, Maurice Herlihy:
Composable memory transactions. PPOPP 2005: 48-60 - 2004
- [j57]Clement A. Baker-Finch, Kevin Glynn, Simon L. Peyton Jones:
Constructed product result analysis for Haskell. J. Funct. Program. 14(2): 211-245 (2004) - [c69]Gregory J. Duck, Simon L. Peyton Jones, Peter J. Stuckey, Martin Sulzmann:
Sound and Decidable Type Inference for Functional Dependencies. ESOP 2004: 49-63 - [c68]Simon Marlow, Simon L. Peyton Jones, Wolfgang Thaller:
Extending the Haskell foreign function interface with concurrency. Haskell 2004: 22-32 - [c67]Norman Ramsey, Simon L. Peyton Jones:
The C - compiler infrastructure. ICFP 2004: 1 - [c66]Simon Marlow, Simon L. Peyton Jones:
Making a fast curry: push/enter vs. eval/apply for higher-order languages. ICFP 2004: 4-15 - [c65]Ralf Lämmel, Simon L. Peyton Jones:
Scrap more boilerplate: reflection, zips, and generalised casts. ICFP 2004: 244-255 - [c64]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 - [c63]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 - 2003
- [j56]Simon L. Peyton Jones:
Haskell 98: Introduction. J. Funct. Program. 13(1): 0-6 (2003) - [j55]Simon L. Peyton Jones:
Haskell 98: Lexical Structure. J. Funct. Program. 13(1): 7-16 (2003) - [j54]Simon L. Peyton Jones:
Haskell 98: Expressions. J. Funct. Program. 13(1): 17-38 (2003) - [j53]Simon L. Peyton Jones:
Haskell 98: Declarations and Bindings. J. Funct. Program. 13(1): 39-66 (2003) - [j52]Simon L. Peyton Jones:
Haskell 98: Modules. J. Funct. Program. 13(1): 67-80 (2003) - [j51]Simon L. Peyton Jones:
Haskell 98: Predefined Types and Classes. J. Funct. Program. 13(1): 81-96 (2003) - [j50]Simon L. Peyton Jones:
Haskell 98: Basic Input/Output. J. Funct. Program. 13(1): 97-102 (2003) - [j49]Simon L. Peyton Jones:
Haskell 98: Standard Prelude. J. Funct. Program. 13(1): 103-124 (2003) - [j48]Simon L. Peyton Jones:
Haskell 98: Syntax Reference. J. Funct. Program. 13(1): 125-138 (2003) - [j47]Simon L. Peyton Jones:
Haskell 98: Specification of Derived Instances. J. Funct. Program. 13(1): 139-144 (2003) - [j46]Simon L. Peyton Jones:
Haskell 98: Compiler Pragmas. J. Funct. Program. 13(1): 145-146 (2003) - [j45]Simon L. Peyton Jones:
Haskell 98 Libraries: Rational Numbers. J. Funct. Program. 13(1): 149-152 (2003) - [j44]Simon L. Peyton Jones:
Haskell 98 Libraries: Complex Numbers. J. Funct. Program. 13(1): 153-156 (2003) - [j43]Simon L. Peyton Jones:
Haskell 98 Libraries: Numeric Functions. J. Funct. Program. 13(1): 157-168 (2003) - [j42]Simon L. Peyton Jones:
Haskell 98 Libraries: Indexing Operations. J. Funct. Program. 13(1): 169-172 (2003) - [j41]Simon L. Peyton Jones:
Haskell 98 Libraries: Arrays. J. Funct. Program. 13(1): 173-178 (2003) - [j40]