Travelled to:1 × Austria
1 × Estonia
1 × Japan
1 × Spain
2 × Denmark
3 × France
3 × Italy
3 × Sweden
30 × USA
4 × The Netherlands
5 × Canada
5 × Germany
5 × United Kingdom
Collaborated with:S.Marlow D.Vytiniotis ∅ J.Launchbury M.M.T.Chakravarty S.Weirich N.Ramsey G.Keller S.Finne M.C.Bolingbroke P.Wadler C.D.Clack S.Singh R.Lämmel R.Ennals P.M.Sansom R.Leshchinskiy B.Lippmeier R.A.Eisenberg T.Schrijvers M.Sulzmann J.Salkild T.Harris G.L.Burn K.Claessen M.Shields P.Achten D.Leijen E.Meijer K.Wansbrough A.P.Tolmach K.Hammond A.M.Cheadle A.J.Field R.L.While P.W.Trinder I.Sergey G.Mainland J.P.Magalhães D.N.Xu A.R.Yakushev B.Rudiak-Gould A.Mycroft A.F.Blackwell M.M.Burnett J.Eber J.Seward O.d.Moor E.V.Wyk C.Elliott F.Reig T.Sheard T.Nordin D.Oliva W.Partain A.Santos A.D.Gordon A.J.Gill J.D.Robson C.Hankin W.Thaller T.H.0001 T.O.R.Allwood S.Eisenbach J.Dias J.Epstein A.P.Black R.Newton J.Stolarek G.Karachalias D.Zhang A.C.Myers J.Breitner S.Kilpatrick D.Dreyer D.Rosén S.Zdancewic R.P.James G.Washburn M.Herlihy G.J.Duck P.J.Stuckey A.Moran J.H.Reppy C.V.Hall M.Hardie P.Li D.Terei D.Mazières L.Maurer P.Downen Z.M.Ariola N.Vazou E.L.Seidel R.Jhala A.Discolo A.Reid F.Henderson C.A.R.Hoare J.S.M.Jr. A.S.Partridge H.Loidl R.G.Morgan S.Poria C.Cooper R.Garigliano G.T.Leavens J.Abrial D.S.Batory M.J.Butler A.Coglio K.Fisler E.C.R.Hehner C.B.Jones D.Miller M.Sitaraman D.R.Smith A.Stump
Talks about:haskel (31) type (24) function (11) languag (9) parallel (8) program (8) class (8) compil (6) lazi (6) collect (5)
Person: Simon L. Peyton Jones
DBLP: Jones:Simon_L=_Peyton
Facilitated 5 volumes:
Ed
Ed
Ed
EdEdContributed to:
2015
2015201420142013
20132013
2013
20132012201120112010
2009200920092008200820082007
2006
2006
2006200620052005
20052004200420042003
200120012000
2000200019991999199919991999
19991998199819971996199619961996199619951994
19941994
1993199319911989
198819871986198619851982
2003200420052007200920102011201220152017Wrote 98 papers:
- ICFP-2015-KarachaliasSVJ #data type #lazy evaluation #pattern matching
- GADTs meet their match: pattern-matching warnings that account for GADTs, guards, and laziness (GK, TS, DV, SLPJ), pp. 424–436.
- PLDI-2015-ZhangMVJ #fault
- Diagnosing type errors with class (DZ, ACM, DV, SLPJ), pp. 12–21.
- ICFP-2014-BreitnerEJW #haskell #low cost
- Safe zero-cost coercions for Haskell (JB, RAE, SLPJ, SW), pp. 189–202.
- ICFP-2014-VazouSJVJ #haskell #refinement
- Refinement types for Haskell (NV, ELS, RJ, DV, SLPJ), pp. 269–282.
- POPL-2014-EisenbergVJW #equation #product line
- Closed type families with overlapping equations (RAE, DV, SLPJ, SW), pp. 671–684.
- POPL-2014-KilpatrickDJM #haskell #interface #named
- Backpack: retrofitting Haskell with interfaces (SK, DD, SLPJ, SM), pp. 19–32.
- POPL-2014-SergeyVJ #analysis #composition #higher-order #theory and practice
- Modular, higher-order cardinality analysis in theory and practice (IS, DV, SLPJ), pp. 335–348.
- ICFP-2013-Jones
- Computer science as a school subject (SLPJ), pp. 159–160.
- ICFP-2013-MainlandLJ
- Exploiting vector instructions with generalized stream fusio (GM, RL, SLPJ), pp. 37–48.
- ITiCSE-2013-Jones
- The computing at school working group (SLPJ), p. 1.
- POPL-2013-VytiniotisJCR #haskell #logic #named #semantics
- HALO: haskell to logic through denotational semantics (DV, SLPJ, KC, DR), pp. 431–442.
- RTA-2013-VytiniotisJ #normalisation
- Evidence Normalization in System FC (DV, SLPJ), pp. 20–38.
- TLCA-2013-Peyton-Jones #compilation #haskell
- Type-Directed Compilation in the Wild: Haskell and Core (SLPJ), p. 1.
- ICFP-2012-LippmeierCKLJ #higher-order #performance
- Work efficient higher-order vectorisation (BL, MMTC, GK, RL, SLPJ), pp. 259–270.
- ICFP-2012-VytiniotisJM #compilation #fault #proving #similarity
- Equality proofs and deferred type errors: a compiler pearl (DV, SLPJ, JPM), pp. 341–352.
- ISMM-2011-MarlowJ #garbage collection #manycore
- Multicore garbage collection with local heaps (SM, SLPJ), pp. 21–32.
- POPL-2011-WeirichVJZ #abstraction #generative
- Generative type abstraction and type-level computation (SW, DV, SLPJ, SZ), pp. 227–240.
- ICFP-2010-KellerCLJL #array #haskell #parallel
- Regular, shape-polymorphic, parallel arrays in Haskell (GK, MMTC, RL, SLPJ, BL), pp. 261–272.
- ECOOP-2009-Jones #haskell #what #why
- Classes, Jim, But Not as We Know Them — Type Classes in Haskell: What, Why, and Whither (SLPJ), p. 1.
- ICFP-2009-MarlowJS #haskell #manycore #runtime
- Runtime support for multicore Haskell (SM, SLPJ, SS), pp. 65–78.
- ICFP-2009-SchrijversJSV #data type #decidability #type inference
- Complete and decidable type inference for GADTs (TS, SLPJ, MS, DV), pp. 341–352.
- POPL-2009-XuJC #contract #haskell
- Static contract checking for Haskell (DNX, SLPJ, KC), pp. 41–52.
- AFP-2008-JonesS08 #concurrent #haskell #parallel #programming #tutorial
- A Tutorial on Parallel and Concurrent Programming in Haskell (SLPJ, SS), pp. 267–305.
- ICFP-2008-SchrijversJCS #type checking
- Type checking with open type functions (TS, SLPJ, MMTC, MS), pp. 51–62.
- ICFP-2008-VytiniotisWJ #haskell #morphism #named #polymorphism
- FPH: first-class polymorphism for Haskell (DV, SW, SLPJ), pp. 295–306.
- ISMM-2008-MarlowHJJ #garbage collection #parallel
- Parallel generational-copying garbage collection with a block-structured heap (SM, TH, RPJ, SLPJ), pp. 11–20.
- ICFP-2007-Jones #haskell #source code
- Call-pattern specialisation for haskell programs (SLPJ), pp. 327–337.
- ICFP-2007-MarlowYJ #lazy evaluation #performance #pointer #using
- Faster laziness using dynamic pointer tagging (SM, ARY, SLPJ), pp. 277–288.
- ESOP-2006-Rudiak-GouldMJ #haskell #ml
- Haskell Is Not Not ML (BRG, AM, SLPJ), pp. 38–53.
- FLOPS-2006-DiscoloHMJS #data type #haskell #using
- Lock Free Data Structures Using STM in Haskell (AD, TH, SM, SLPJ, SS), pp. 65–80.
- GPCE-2006-LeavensABBCFHJMJSSS #roadmap #verification
- Roadmap for enhanced languages and methods to aid verification (GTL, JRA, DSB, MJB, AC, KF, ECRH, CBJ, DM, SLPJ, MS, DRS, AS), pp. 221–236.
- ICFP-2006-JonesVWW #data type #type inference
- Simple unification-based type inference for GADTs (SLPJ, DV, SW, GW), pp. 50–61.
- ICFP-2006-VytiniotisWJ #rank
- Boxy types: inference for higher-rank types and impredicativity (DV, SW, SLPJ), pp. 251–262.
- ICFP-2005-ChakravartyKJ
- Associated type synonyms (MMTC, GK, SLPJ), pp. 241–253.
- ICFP-2005-LammelJ #scrap your boilerplate
- Scrap your boilerplate with class: extensible generic functions (RL, SLPJ), pp. 204–215.
- POPL-2005-ChakravartyKJM
- Associated types with class (MMTC, GK, SLPJ, SM), pp. 1–13.
- PPoPP-2005-HarrisMPH #composition #memory management #transaction
- Composable memory transactions (TH, SM, SLPJ, MH), pp. 48–60.
- ESOP-2004-DuckPSS #decidability #dependence #functional #type inference
- Sound and Decidable Type Inference for Functional Dependencies (GJD, SLPJ, PJS, MS), pp. 49–63.
- ICFP-2004-LammelJ #scrap your boilerplate
- Scrap more boilerplate: reflection, zips, and generalised casts (RL, SLPJ), pp. 244–255.
- ICFP-2004-MarlowJ #higher-order #performance
- Making a fast curry: push/enter vs. eval/apply for higher-order languages (SM, SLPJ), pp. 4–15.
- ICFP-2004-RamseyJ #c #compilation #framework
- The C — compiler infrastructure (NR, SLPJ), p. 1.
- ISMM-2004-CheadleFMJW #garbage collection #haskell #incremental
- Exploring the barrier to entry: incremental generational garbage collection for Haskell (AMC, AJF, SM, SLPJ, RLW), pp. 163–174.
- ICFP-2003-EnnalsJ #adaptation #evaluation #source code #strict
- Optimistic evaluation: an adaptive evaluation strategy for non-strict programs (RE, SLPJ), pp. 287–298.
- ICFP-2003-JonesBB #approach
- A user-centred approach to functions in Excel (SLPJ, AFB, MMB), pp. 165–176.
- FME-2001-Jones #contract
- Composing Contracts: An Adventure in Financial Engineering (SLPJ), p. 435.
- PLDI-2001-MarlowJMR #exception #haskell
- Asynchronous Exceptions in Haskell (SM, SLPJ, AM, JHR), pp. 274–285.
- ICFP-2000-CheadleFMJW #haskell
- Non-stop Haskell (AMC, AJF, SM, SLPJ, RLW), pp. 257–267.
- ICFP-2000-JonesES #contract #functional
- Composing contracts: an adventure in financial engineering, functional pearl (SLPJ, JME, JS), pp. 280–292.
- IFL-2000-AchtenJ #haskell #library #migration
- Porting the Clean Object I/O Library to Haskell (PA, SLPJ), pp. 194–213.
- PLDI-2000-RamseyJ #exception #implementation #multi
- A single intermediate language that supports multiple implementations of exceptions (NR, SLPJ), pp. 285–298.
- GCSE-1999-MoorPW #aspect-oriented #compilation
- Aspect-Oriented Compilers (OdM, SLPJ, EVW), pp. 121–133.
- ICFP-1999-FinneLMJ
- Calling Hell From Heaven and Heaven From Hell (SF, DL, EM, SLPJ), pp. 114–125.
- IFL-1999-JonesME #haskell #pointer
- Stretching the Storage Manager: Weak Pointers and Stable Names in Haskell (SLPJ, SM, CE), pp. 37–58.
- PLDI-1999-JonesRHHM #exception #semantics
- A Semantics for Imprecise Exceptions (SLPJ, AR, FH, CARH, SM), pp. 25–36.
- POPL-1999-WansbroughJ #polymorphism
- Once Upon a Polymorphic Type (KW, SLPJ), pp. 15–28.
- PPDP-1999-JonesRR #assembly #garbage collection #named
- C--: A Portable Assembly Language that Supports Garbage Collection (SLPJ, NR, FR), pp. 1–28.
- ICFP-1998-FinneLMJ #haskell #interface #named
- H/Direct: A Binary Foreign Language Interface for Haskell (SF, DL, EM, SLPJ), pp. 153–162.
- POPL-1998-JonesSLT #haskell #ml
- Bridging the Gulf: A Common Intermediate Language for ML and Haskell (SLPJ, MS, JL, APT), pp. 49–61.
- POPL-1998-ShieldsSJ #dynamic typing #staged #type inference #type system
- Dynamic Typing as Staged Type Inference (MS, TS, SLPJ), pp. 289–302.
- IFL-1997-JonesNO #assembly #named
- C-: A Portable Assembly Language (SLPJ, TN, DO), pp. 1–19.
- IFL-1997-LoidlMTPCJG #functional #scalability
- Parallelising a Large Functional Program or: Keeping LOLITA Busy (HWL, RGM, PWT, SP, CC, SLPJ, RG), pp. 198–213.
- AFP-1996-FinneJ96 #user interface
- Composing the User Interface with Haggis (SF, SLPJ), pp. 1–37.
- ESOP-1996-Jones96a #compilation #haskell #program transformation
- Compiling Haskell by Program Transformation: A Report from the Trenches (SLPJ), pp. 18–44.
- ICFP-1996-JonesPS #float #named #performance #source code
- Let-floating: Moving Bindings to Give Faster Programs (SLPJ, WP, AS), pp. 1–12.
- PLDI-1996-TrinderHMPJ #haskell #implementation #named #parallel
- GUM: A Portable Parallel Implementation of Haskell (PWT, KH, JSMJ, ASP, SLPJ), pp. 79–88.
- POPL-1996-JonesGF #concurrent #haskell
- Concurrent Haskell (SLPJ, ADG, SF), pp. 295–308.
- POPL-1995-SansomJ #functional #higher-order #profiling #strict
- Time and Space Profiling for Non-Strict Higher-Order Functional Languages (PMS, SLPJ), pp. 355–366.
- ESOP-1994-HallHJW #haskell
- Type Classes in Haskell (CVH, KH, SLPJ, PW), pp. 241–256.
- ICLP-1994-LaunchburyJ #lazy evaluation #thread
- Lazy Funtional State Threads: An Abstract (JL, SLPJ), pp. 3–5.
- PLDI-1994-LaunchburyJ #functional #lazy evaluation #thread
- Lazy Functional State Threads (JL, SLPJ), pp. 24–35.
- FPCA-1993-GillLJ #deforestation
- A Short Cut to Deforestation (AJG, JL, SLPJ), pp. 223–232.
- FPCA-1993-SansomJ #garbage collection #haskell
- Generational Garbage Collection for Haskell (PMS, SLPJ), pp. 106–116.
- POPL-1993-JonesW #functional #imperative #programming
- Imperative Functional Programming (SLPJ, PW), pp. 71–84.
- FPCA-1991-JonesL #functional #strict
- Unboxed Values as First Class Citizens in a Non-Strict Functional Language (SLPJ, JL), pp. 636–666.
- FPCA-1989-JonesS
- The Spineless Tagless G-Machine (SLPJ, JS), pp. 184–201.
- LFP-1988-BurnJR
- The Spineless G-Machine (GLB, SLPJ, JDR), pp. 244–258.
- FPCA-1987-JonesCSH #architecture #graph #named #parallel #reduction
- GRIP — A high-performance architecture for parallel graph reduction (SLPJ, CDC, JS, MH), pp. 98–112.
- ESOP-1986-HankinBJ #approach #combinator #parallel #reduction
- A Safe Approach to Parallel Combinator Reduction (CH, GLB, SLPJ), pp. 99–110.
- LFP-1986-ClackJ #reduction
- The Four-Stroke Reduction Engine (CDC, SLPJ), pp. 220–232.
- FPCA-1985-ClackJ85 #analysis #approach #strict
- Strictness Analysis — A Practical Approach (CDC, SLPJ), pp. 35–49.
- LFP-1982-Jones #combinator
- An Investigation of the Relative Efficiencies of Combinators and λ Expressions (SLPJ), pp. 150–158.
- Haskell-2003-EnnalsJ #debugging #lazy evaluation #named #source code
- HsDebug: debugging lazy programs by not being lazy (RE, SLPJ), pp. 84–87.
- Haskell-2004-MarlowJT #concurrent #haskell #interface
- Extending the Haskell foreign function interface with concurrency (SM, SLPJ, WT), pp. 22–32.
- Haskell-2005-HarrisMJ #haskell #multi
- Haskell on a shared-memory multiprocessor (TH0, SM, SLPJ), pp. 49–61.
- Haskell-2007-JonesW
- Comprehensive comprehensions (SLPJ, PW), pp. 61–72.
- Haskell-2007-LiMJT #concurrent #haskell #lightweight
- Lightweight concurrency primitives for GHC (PL, SM, SLPJ, APT), pp. 107–118.
- Haskell-2009-AllwoodJE #haskell #stack
- Finding the needle: stack traces for GHC (TORA, SLPJ, SE), pp. 129–140.
- Haskell-2009-BolingbrokeJ
- Types are calling conventions (MCB, SLPJ), pp. 1–12.
- Haskell-2010-BolingbrokeJ #evaluation #supercompilation
- Supercompilation by evaluation (MCB, SLPJ), pp. 135–146.
- Haskell-2010-RamseyDJ #analysis #composition #data flow #library #named #reuse
- Hoopl: a modular, reusable library for dataflow analysis and transformation (NR, JD, SLPJ), pp. 121–134.
- Haskell-2011-BolingbrokeJV #combinator #termination
- Termination combinators forever (MCB, SLPJ, DV), pp. 23–34.
- Haskell-2011-EpsteinBJ #haskell #in the cloud #towards
- Towards Haskell in the cloud (JE, APB, SLPJ), pp. 118–129.
- Haskell-2011-MarlowNJ #monad #parallel
- A monad for deterministic parallelism (SM, RN, SLPJ), pp. 71–82.
- Haskell-2012-KellerCLLJ
- Vectorisation avoidance (GK, MMTC, RL, BL, SLPJ), pp. 37–48.
- Haskell-2012-LippmeierCKJ #array #parallel
- Guiding parallel array fusion with indexed types (BL, MMTC, GK, SLPJ), pp. 25–36.
- Haskell-2012-TereiMJM #haskell
- Safe haskell (DT, SM, SLPJ, DM), pp. 137–148.
- Haskell-2015-StolarekJE #haskell #injection #product line
- Injective type families for Haskell (JS, SLPJ, RAE), pp. 118–128.
- PLDI-2017-MaurerDAJ #compilation #continuation
- Compiling without continuations (LM, PD, ZMA, SLPJ), pp. 482–494.